/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:06:52,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:06:52,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:06:52,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:06:52,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:06:52,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:06:52,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:06:52,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:06:52,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:06:52,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:06:52,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:06:52,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:06:52,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:06:52,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:06:52,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:06:52,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:06:52,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:06:52,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:06:52,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:06:52,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:06:52,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:06:52,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:06:52,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:06:52,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:06:52,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:06:52,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:06:52,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:06:52,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:06:52,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:06:52,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:06:52,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:06:52,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:06:52,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:06:52,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:06:52,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:06:52,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:06:52,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:06:52,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:06:52,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:06:52,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:06:52,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:06:52,766 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:06:52,780 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:06:52,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:06:52,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:06:52,782 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:06:52,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:06:52,782 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:06:52,782 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:06:52,783 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:06:52,783 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:06:52,783 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:06:52,783 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:06:52,783 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:06:52,783 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:06:52,784 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:06:52,784 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:06:52,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:06:52,784 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:06:52,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:06:52,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:06:52,785 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:06:52,785 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:06:52,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:06:52,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:06:52,785 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:06:52,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:06:52,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:06:52,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:06:52,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:06:52,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:06:52,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:06:52,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:06:52,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:06:52,968 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:06:52,969 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:06:52,970 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:06:53,059 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_iKy6E0/tmp/b92f93319f4e4e88abe52e0e1e0e0951/FLAG30aa0da32 [2020-07-01 13:06:53,400 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:06:53,400 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:06:53,401 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:06:53,407 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_iKy6E0/tmp/b92f93319f4e4e88abe52e0e1e0e0951/FLAG30aa0da32 [2020-07-01 13:06:53,804 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_iKy6E0/tmp/b92f93319f4e4e88abe52e0e1e0e0951 [2020-07-01 13:06:53,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:06:53,817 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:06:53,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:06:53,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:06:53,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:06:53,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:06:53" (1/1) ... [2020-07-01 13:06:53,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56117edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:53, skipping insertion in model container [2020-07-01 13:06:53,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:06:53" (1/1) ... [2020-07-01 13:06:53,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:06:53,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:06:54,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:06:54,101 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:06:54,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:06:54,134 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:06:54,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54 WrapperNode [2020-07-01 13:06:54,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:06:54,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:06:54,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:06:54,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:06:54,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:06:54,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:06:54,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:06:54,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:06:54,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:06:54,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:06:54,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:06:54,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:06:54,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:06:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:06:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:06:54,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:06:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:06:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:06:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:06:54,581 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:06:54,581 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:06:54,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54 BoogieIcfgContainer [2020-07-01 13:06:54,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:06:54,586 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:06:54,586 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:06:54,589 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:06:54,590 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,605 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges [2020-07-01 13:06:54,609 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:06:54,610 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:06:54,610 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:06:54,611 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:06:54,613 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:06:54,614 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:06:54,614 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:06:54,639 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:06:54,682 INFO L200 BlockEncoder]: SBE split 27 edges [2020-07-01 13:06:54,687 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:06:54,689 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:06:54,721 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 13:06:54,724 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:06:54,726 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:06:54,726 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:06:54,726 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:06:54,727 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:06:54,727 INFO L313 BlockEncoder]: Encoded RCFG 40 locations, 81 edges [2020-07-01 13:06:54,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:06:54 BasicIcfg [2020-07-01 13:06:54,728 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:06:54,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:06:54,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:06:54,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:06:54,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:06:53" (1/4) ... [2020-07-01 13:06:54,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2e111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:06:54, skipping insertion in model container [2020-07-01 13:06:54,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (2/4) ... [2020-07-01 13:06:54,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2e111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:06:54, skipping insertion in model container [2020-07-01 13:06:54,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54" (3/4) ... [2020-07-01 13:06:54,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2e111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:06:54, skipping insertion in model container [2020-07-01 13:06:54,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:06:54" (4/4) ... [2020-07-01 13:06:54,737 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:06:54,747 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:06:54,755 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-07-01 13:06:54,768 INFO L251 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-07-01 13:06:54,792 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:06:54,792 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:06:54,792 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:06:54,792 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:06:54,793 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:06:54,793 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:06:54,793 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:06:54,793 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:06:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-01 13:06:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:06:54,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:54,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:06:54,815 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:54,821 INFO L82 PathProgramCache]: Analyzing trace with hash 124461, now seen corresponding path program 1 times [2020-07-01 13:06:54,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:54,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046722469] [2020-07-01 13:06:54,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:54,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046722469] [2020-07-01 13:06:54,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:54,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:54,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606530992] [2020-07-01 13:06:54,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:54,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,016 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-01 13:06:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,196 INFO L93 Difference]: Finished difference Result 78 states and 145 transitions. [2020-07-01 13:06:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:06:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,210 INFO L225 Difference]: With dead ends: 78 [2020-07-01 13:06:55,211 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 13:06:55,214 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 13:06:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 13:06:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 13:06:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. [2020-07-01 13:06:55,252 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 3 [2020-07-01 13:06:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,253 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. [2020-07-01 13:06:55,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-01 13:06:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:06:55,253 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:06:55,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:06:55,255 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash 124740, now seen corresponding path program 1 times [2020-07-01 13:06:55,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554416106] [2020-07-01 13:06:55,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554416106] [2020-07-01 13:06:55,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636526113] [2020-07-01 13:06:55,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,329 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 3 states. [2020-07-01 13:06:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,455 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-01 13:06:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:06:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,458 INFO L225 Difference]: With dead ends: 40 [2020-07-01 13:06:55,458 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 13:06:55,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 13:06:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 13:06:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:06:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 60 transitions. [2020-07-01 13:06:55,465 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 60 transitions. Word has length 3 [2020-07-01 13:06:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,465 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 60 transitions. [2020-07-01 13:06:55,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2020-07-01 13:06:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:06:55,466 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:06:55,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:06:55,466 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,467 INFO L82 PathProgramCache]: Analyzing trace with hash 124742, now seen corresponding path program 1 times [2020-07-01 13:06:55,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702094613] [2020-07-01 13:06:55,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702094613] [2020-07-01 13:06:55,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111844211] [2020-07-01 13:06:55,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,524 INFO L87 Difference]: Start difference. First operand 37 states and 60 transitions. Second operand 3 states. [2020-07-01 13:06:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,618 INFO L93 Difference]: Finished difference Result 37 states and 60 transitions. [2020-07-01 13:06:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:06:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,620 INFO L225 Difference]: With dead ends: 37 [2020-07-01 13:06:55,620 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:06:55,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:06:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:06:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:06:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. [2020-07-01 13:06:55,625 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 3 [2020-07-01 13:06:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,625 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. [2020-07-01 13:06:55,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2020-07-01 13:06:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:06:55,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:06:55,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:06:55,627 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 3865359, now seen corresponding path program 1 times [2020-07-01 13:06:55,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514627344] [2020-07-01 13:06:55,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514627344] [2020-07-01 13:06:55,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700581607] [2020-07-01 13:06:55,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,669 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. [2020-07-01 13:06:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,756 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. [2020-07-01 13:06:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:06:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,758 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:06:55,758 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:06:55,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:06:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:06:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 50 transitions. [2020-07-01 13:06:55,763 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 50 transitions. Word has length 4 [2020-07-01 13:06:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,763 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 50 transitions. [2020-07-01 13:06:55,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2020-07-01 13:06:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:06:55,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:06:55,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:06:55,765 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 3865361, now seen corresponding path program 1 times [2020-07-01 13:06:55,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389425716] [2020-07-01 13:06:55,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389425716] [2020-07-01 13:06:55,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840520013] [2020-07-01 13:06:55,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,801 INFO L87 Difference]: Start difference. First operand 32 states and 50 transitions. Second operand 3 states. [2020-07-01 13:06:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,872 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2020-07-01 13:06:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:06:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,873 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:06:55,873 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:06:55,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:06:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:06:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2020-07-01 13:06:55,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 4 [2020-07-01 13:06:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,878 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 48 transitions. [2020-07-01 13:06:55,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2020-07-01 13:06:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:06:55,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:06:55,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:06:55,879 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 3865362, now seen corresponding path program 1 times [2020-07-01 13:06:55,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621034594] [2020-07-01 13:06:55,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621034594] [2020-07-01 13:06:55,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245868482] [2020-07-01 13:06:55,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,931 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. Second operand 3 states. [2020-07-01 13:06:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,020 INFO L93 Difference]: Finished difference Result 32 states and 48 transitions. [2020-07-01 13:06:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:06:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,022 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:06:56,022 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:06:56,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:06:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 13:06:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 13:06:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2020-07-01 13:06:56,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 4 [2020-07-01 13:06:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,027 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2020-07-01 13:06:56,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2020-07-01 13:06:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:06:56,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:06:56,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:06:56,028 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash 119824305, now seen corresponding path program 1 times [2020-07-01 13:06:56,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671909535] [2020-07-01 13:06:56,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671909535] [2020-07-01 13:06:56,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798916606] [2020-07-01 13:06:56,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,065 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand 3 states. [2020-07-01 13:06:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,131 INFO L93 Difference]: Finished difference Result 30 states and 46 transitions. [2020-07-01 13:06:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:06:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,132 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:06:56,132 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:06:56,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:06:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:06:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:06:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-07-01 13:06:56,136 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 5 [2020-07-01 13:06:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,137 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-07-01 13:06:56,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2020-07-01 13:06:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:06:56,137 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:06:56,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:06:56,138 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash 119824306, now seen corresponding path program 1 times [2020-07-01 13:06:56,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538161092] [2020-07-01 13:06:56,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538161092] [2020-07-01 13:06:56,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328973370] [2020-07-01 13:06:56,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,166 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 3 states. [2020-07-01 13:06:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,217 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-01 13:06:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:06:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,218 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:06:56,218 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:06:56,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:06:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:06:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:06:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-01 13:06:56,222 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 5 [2020-07-01 13:06:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,223 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-01 13:06:56,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-01 13:06:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:06:56,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:06:56,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:06:56,224 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash 119824307, now seen corresponding path program 1 times [2020-07-01 13:06:56,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620756155] [2020-07-01 13:06:56,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620756155] [2020-07-01 13:06:56,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668698325] [2020-07-01 13:06:56,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,262 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2020-07-01 13:06:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,318 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2020-07-01 13:06:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:06:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,319 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:06:56,319 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:06:56,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:06:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:06:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:06:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-07-01 13:06:56,324 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 5 [2020-07-01 13:06:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,324 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-07-01 13:06:56,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-07-01 13:06:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:06:56,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:06:56,325 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash -580416592, now seen corresponding path program 1 times [2020-07-01 13:06:56,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608808832] [2020-07-01 13:06:56,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608808832] [2020-07-01 13:06:56,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878398695] [2020-07-01 13:06:56,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,358 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2020-07-01 13:06:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,410 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2020-07-01 13:06:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:06:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,411 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:06:56,411 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 13:06:56,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 13:06:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 13:06:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 13:06:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-01 13:06:56,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 6 [2020-07-01 13:06:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,415 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-01 13:06:56,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-01 13:06:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:06:56,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:06:56,417 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash -580416590, now seen corresponding path program 1 times [2020-07-01 13:06:56,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864060062] [2020-07-01 13:06:56,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864060062] [2020-07-01 13:06:56,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618168122] [2020-07-01 13:06:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,451 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2020-07-01 13:06:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,501 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-01 13:06:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:06:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,502 INFO L225 Difference]: With dead ends: 20 [2020-07-01 13:06:56,502 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:06:56,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:06:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:06:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:06:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:06:56,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 13:06:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,504 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:06:56,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:06:56,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:06:56,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:06:56,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:06:56,551 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:06:56,551 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 13:06:56,551 INFO L268 CegarLoopResult]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-07-01 13:06:56,551 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:06:56,552 INFO L264 CegarLoopResult]: At program point L15-2(lines 14 18) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_f_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_f_~flag~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~flag~0.base)) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_f_~c~0.base)) (= 0 ULTIMATE.start_f_~y_ref~0.offset) (= 0 ULTIMATE.start_f_~c~0.offset) (= 0 ULTIMATE.start_f_~x_ref~0.offset) (= (select |#length| ULTIMATE.start_f_~y_ref~0.base) 4) (= 4 (select |#length| ULTIMATE.start_f_~c~0.base)) (= 0 ULTIMATE.start_f_~flag~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~x_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~y_ref~0.base))) [2020-07-01 13:06:56,552 INFO L268 CegarLoopResult]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2020-07-01 13:06:56,552 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:06:56,552 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,553 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,554 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point L16-3(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point L16-4(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:06:56,555 INFO L268 CegarLoopResult]: For program point L16-5(line 16) no Hoare annotation was computed. [2020-07-01 13:06:56,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:06:56,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:06:56,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:06:56,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:06:56,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:06:56,556 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:06:56,559 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:06:56,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:06:56,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:06:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:56,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:06:56 BasicIcfg [2020-07-01 13:06:56,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:06:56,583 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:06:56,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:06:56,587 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:06:56,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:06:56,588 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:06:53" (1/5) ... [2020-07-01 13:06:56,589 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3747c719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:06:56, skipping insertion in model container [2020-07-01 13:06:56,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:06:56,589 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (2/5) ... [2020-07-01 13:06:56,589 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3747c719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:06:56, skipping insertion in model container [2020-07-01 13:06:56,590 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:06:56,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54" (3/5) ... [2020-07-01 13:06:56,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3747c719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:06:56, skipping insertion in model container [2020-07-01 13:06:56,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:06:56,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:06:54" (4/5) ... [2020-07-01 13:06:56,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3747c719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:06:56, skipping insertion in model container [2020-07-01 13:06:56,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:06:56,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:06:56" (5/5) ... [2020-07-01 13:06:56,605 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:06:56,629 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:06:56,629 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:06:56,630 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:06:56,630 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:06:56,630 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:06:56,630 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:06:56,630 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:06:56,630 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:06:56,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-07-01 13:06:56,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:06:56,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:06:56,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:06:56,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,646 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:06:56,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2020-07-01 13:06:56,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:06:56,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:06:56,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:06:56,650 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,650 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,655 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [94] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [150] L-1-->L11: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (> 0 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 35#L11true [95] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3)) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 32#L11-1true [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 17#L12true [66] L12-->L13: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1))) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 39#L13true [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (= (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0)) |v_#memory_int_7|) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 40#L15-2true [2020-07-01 13:06:56,656 INFO L796 eck$LassoCheckResult]: Loop: 40#L15-2true [105] L15-2-->L15: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 23#L15true [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 4#L16true [204] L16-->L16-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= 1 (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12)) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 22#L16-2true [77] L16-2-->L16-3: Formula: (and (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= 1 (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9)) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 20#L16-3true [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 18#L16-4true [189] L16-4-->L16-5: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 0)) |v_#memory_int_14|) (= 1 (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9)) (>= |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 15#L16-5true [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 27#L17true [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= 1 (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6)) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 25#L17-1true [208] L17-1-->L15-2: Formula: (and (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19))) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 40#L15-2true [2020-07-01 13:06:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash -574875528, now seen corresponding path program 1 times [2020-07-01 13:06:56,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604026260] [2020-07-01 13:06:56,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604026260] [2020-07-01 13:06:56,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637982066] [2020-07-01 13:06:56,677 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:06:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 1 times [2020-07-01 13:06:56,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45938397] [2020-07-01 13:06:56,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:06:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:06:56,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:06:56,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,896 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-01 13:06:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,991 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-01 13:06:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,994 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:06:56,999 INFO L168 Benchmark]: Toolchain (without parser) took 3180.99 ms. Allocated memory was 649.6 MB in the beginning and 747.6 MB in the end (delta: 98.0 MB). Free memory was 561.6 MB in the beginning and 655.1 MB in the end (delta: -93.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:06:56,999 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:06:57,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.46 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 561.6 MB in the beginning and 647.3 MB in the end (delta: -85.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:06:57,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 685.2 MB. Free memory was 647.3 MB in the beginning and 644.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:06:57,001 INFO L168 Benchmark]: Boogie Preprocessor took 25.15 ms. Allocated memory is still 685.2 MB. Free memory was 644.7 MB in the beginning and 643.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:06:57,001 INFO L168 Benchmark]: RCFGBuilder took 382.80 ms. Allocated memory is still 685.2 MB. Free memory was 643.3 MB in the beginning and 616.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:06:57,002 INFO L168 Benchmark]: BlockEncodingV2 took 142.05 ms. Allocated memory is still 685.2 MB. Free memory was 616.9 MB in the beginning and 604.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:06:57,002 INFO L168 Benchmark]: TraceAbstraction took 1853.30 ms. Allocated memory is still 685.2 MB. Free memory was 604.7 MB in the beginning and 390.1 MB in the end (delta: 214.6 MB). Peak memory consumption was 214.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:06:57,003 INFO L168 Benchmark]: BuchiAutomizer took 412.84 ms. Allocated memory was 685.2 MB in the beginning and 747.6 MB in the end (delta: 62.4 MB). Free memory was 390.1 MB in the beginning and 655.1 MB in the end (delta: -265.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:06:57,006 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 48 edges - StatisticsResult: Encoded RCFG 40 locations, 81 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 317.46 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 561.6 MB in the beginning and 647.3 MB in the end (delta: -85.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 685.2 MB. Free memory was 647.3 MB in the beginning and 644.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.15 ms. Allocated memory is still 685.2 MB. Free memory was 644.7 MB in the beginning and 643.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 382.80 ms. Allocated memory is still 685.2 MB. Free memory was 643.3 MB in the beginning and 616.9 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 142.05 ms. Allocated memory is still 685.2 MB. Free memory was 616.9 MB in the beginning and 604.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1853.30 ms. Allocated memory is still 685.2 MB. Free memory was 604.7 MB in the beginning and 390.1 MB in the end (delta: 214.6 MB). Peak memory consumption was 214.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 412.84 ms. Allocated memory was 685.2 MB in the beginning and 747.6 MB in the end (delta: 62.4 MB). Free memory was 390.1 MB in the beginning and 655.1 MB in the end (delta: -265.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 13:06:57,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:57,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:57,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:06:57,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:57,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:57,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:57,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:57,019 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:06:57,019 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:06:57,019 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((4 == unknown-#length-unknown[x_ref] && 4 == unknown-#length-unknown[flag]) && 1 == \valid[flag]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[c]) && 0 == y_ref) && 0 == c) && 0 == x_ref) && unknown-#length-unknown[y_ref] == 4) && 4 == unknown-#length-unknown[c]) && 0 == flag) && 1 == \valid[x_ref]) && 1 == \valid[y_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 24 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 443 SDslu, 6 SDs, 0 SdLazy, 424 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 56 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:06:50.541 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_iKy6E0/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:06:57.243 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check