java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label21_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:34:57,048 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:34:57,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:34:57,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:34:57,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:34:57,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:34:57,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:34:57,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:34:57,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:34:57,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:34:57,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:34:57,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:34:57,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:34:57,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:34:57,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:34:57,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:34:57,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:34:57,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:34:57,103 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:34:57,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:34:57,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:34:57,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:34:57,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:34:57,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:34:57,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:34:57,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:34:57,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:34:57,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:34:57,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:34:57,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:34:57,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:34:57,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:34:57,119 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:34:57,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:34:57,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:34:57,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:34:57,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:34:57,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:34:57,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:34:57,143 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:34:57,143 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:34:57,144 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:34:57,144 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:34:57,144 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:34:57,144 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:34:57,144 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:34:57,145 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:34:57,145 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:34:57,145 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:34:57,145 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:34:57,145 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:34:57,146 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:34:57,146 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:34:57,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:34:57,147 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:34:57,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:34:57,147 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:34:57,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:34:57,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:34:57,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:34:57,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:34:57,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:34:57,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:34:57,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:34:57,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:34:57,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:34:57,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:34:57,150 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:34:57,150 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:34:57,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:34:57,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:34:57,150 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:34:57,151 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:34:57,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:34:57,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:34:57,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:34:57,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:34:57,225 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:34:57,226 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label21_false-unreach-call.c [2018-10-24 23:34:57,286 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b22378118/05ff1b6a3ffe4e1ba77a420264b01e78/FLAGdf40c2cb9 [2018-10-24 23:34:58,077 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:34:58,078 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label21_false-unreach-call.c [2018-10-24 23:34:58,117 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b22378118/05ff1b6a3ffe4e1ba77a420264b01e78/FLAGdf40c2cb9 [2018-10-24 23:34:58,137 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b22378118/05ff1b6a3ffe4e1ba77a420264b01e78 [2018-10-24 23:34:58,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:34:58,152 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:34:58,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:34:58,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:34:58,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:34:58,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:34:58" (1/1) ... [2018-10-24 23:34:58,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b326c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:58, skipping insertion in model container [2018-10-24 23:34:58,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:34:58" (1/1) ... [2018-10-24 23:34:58,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:34:58,364 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:34:59,780 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:34:59,784 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:35:00,573 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:35:00,611 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:35:00,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00 WrapperNode [2018-10-24 23:35:00,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:35:00,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:35:00,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:35:00,613 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:35:00,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:00,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:35:01,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:35:01,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:35:01,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:35:01,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... [2018-10-24 23:35:01,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:35:01,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:35:01,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:35:01,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:35:01,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:35:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:35:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:35:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:35:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:35:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:35:01,601 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:35:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:35:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:35:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:35:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:35:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:35:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:35:01,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:35:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:35:12,620 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:35:12,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:35:12 BoogieIcfgContainer [2018-10-24 23:35:12,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:35:12,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:35:12,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:35:12,626 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:35:12,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:34:58" (1/3) ... [2018-10-24 23:35:12,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf2b5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:35:12, skipping insertion in model container [2018-10-24 23:35:12,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:35:00" (2/3) ... [2018-10-24 23:35:12,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf2b5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:35:12, skipping insertion in model container [2018-10-24 23:35:12,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:35:12" (3/3) ... [2018-10-24 23:35:12,629 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label21_false-unreach-call.c [2018-10-24 23:35:12,639 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:35:12,649 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:35:12,667 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:35:12,717 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:35:12,717 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:35:12,718 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:35:12,718 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:35:12,718 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:35:12,718 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:35:12,718 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:35:12,718 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:35:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:35:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 23:35:12,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:35:12,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:35:12,780 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:35:12,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash -657257213, now seen corresponding path program 1 times [2018-10-24 23:35:12,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:35:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:12,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:35:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:12,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:35:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:35:13,220 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-24 23:35:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:35:13,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:35:13,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:35:13,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:35:13,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:35:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:35:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:35:13,263 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-24 23:35:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:35:28,694 INFO L93 Difference]: Finished difference Result 4063 states and 7611 transitions. [2018-10-24 23:35:28,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:35:28,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-24 23:35:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:35:28,741 INFO L225 Difference]: With dead ends: 4063 [2018-10-24 23:35:28,741 INFO L226 Difference]: Without dead ends: 2937 [2018-10-24 23:35:28,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:35:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2018-10-24 23:35:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1982. [2018-10-24 23:35:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-10-24 23:35:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3456 transitions. [2018-10-24 23:35:28,922 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3456 transitions. Word has length 27 [2018-10-24 23:35:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:35:28,923 INFO L481 AbstractCegarLoop]: Abstraction has 1982 states and 3456 transitions. [2018-10-24 23:35:28,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:35:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3456 transitions. [2018-10-24 23:35:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 23:35:28,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:35:28,929 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:35:28,929 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:35:28,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1730272033, now seen corresponding path program 1 times [2018-10-24 23:35:28,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:35:28,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:28,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:35:28,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:28,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:35:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:35:29,308 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:35:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:35:29,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:35:29,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:35:29,445 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:35:29,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:35:29,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:35:29,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:35:29,448 INFO L87 Difference]: Start difference. First operand 1982 states and 3456 transitions. Second operand 6 states. [2018-10-24 23:35:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:35:46,390 INFO L93 Difference]: Finished difference Result 7277 states and 13063 transitions. [2018-10-24 23:35:46,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:35:46,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-10-24 23:35:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:35:46,433 INFO L225 Difference]: With dead ends: 7277 [2018-10-24 23:35:46,434 INFO L226 Difference]: Without dead ends: 5301 [2018-10-24 23:35:46,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:35:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2018-10-24 23:35:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5252. [2018-10-24 23:35:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2018-10-24 23:35:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8253 transitions. [2018-10-24 23:35:46,636 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8253 transitions. Word has length 98 [2018-10-24 23:35:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:35:46,637 INFO L481 AbstractCegarLoop]: Abstraction has 5252 states and 8253 transitions. [2018-10-24 23:35:46,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:35:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8253 transitions. [2018-10-24 23:35:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-24 23:35:46,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:35:46,642 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:35:46,642 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:35:46,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1080221806, now seen corresponding path program 1 times [2018-10-24 23:35:46,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:35:46,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:46,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:35:46,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:46,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:35:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:35:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:35:46,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:35:46,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:35:46,883 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:35:46,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:35:46,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:35:46,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:35:46,885 INFO L87 Difference]: Start difference. First operand 5252 states and 8253 transitions. Second operand 6 states. [2018-10-24 23:36:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:00,630 INFO L93 Difference]: Finished difference Result 13914 states and 22498 transitions. [2018-10-24 23:36:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:36:00,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-10-24 23:36:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:00,675 INFO L225 Difference]: With dead ends: 13914 [2018-10-24 23:36:00,676 INFO L226 Difference]: Without dead ends: 8668 [2018-10-24 23:36:00,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:36:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8668 states. [2018-10-24 23:36:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8668 to 8605. [2018-10-24 23:36:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8605 states. [2018-10-24 23:36:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8605 states to 8605 states and 12803 transitions. [2018-10-24 23:36:00,931 INFO L78 Accepts]: Start accepts. Automaton has 8605 states and 12803 transitions. Word has length 101 [2018-10-24 23:36:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:00,932 INFO L481 AbstractCegarLoop]: Abstraction has 8605 states and 12803 transitions. [2018-10-24 23:36:00,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:36:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8605 states and 12803 transitions. [2018-10-24 23:36:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-24 23:36:00,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:00,943 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:36:00,943 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:00,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash 946861634, now seen corresponding path program 1 times [2018-10-24 23:36:00,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:00,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:00,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:00,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:01,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:01,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:36:01,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:01,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:36:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:36:01,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:36:01,315 INFO L87 Difference]: Start difference. First operand 8605 states and 12803 transitions. Second operand 5 states. [2018-10-24 23:36:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:17,637 INFO L93 Difference]: Finished difference Result 25982 states and 40339 transitions. [2018-10-24 23:36:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:36:17,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-10-24 23:36:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:17,713 INFO L225 Difference]: With dead ends: 25982 [2018-10-24 23:36:17,713 INFO L226 Difference]: Without dead ends: 17383 [2018-10-24 23:36:17,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:36:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17383 states. [2018-10-24 23:36:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17383 to 17120. [2018-10-24 23:36:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17120 states. [2018-10-24 23:36:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17120 states to 17120 states and 24327 transitions. [2018-10-24 23:36:18,120 INFO L78 Accepts]: Start accepts. Automaton has 17120 states and 24327 transitions. Word has length 111 [2018-10-24 23:36:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:18,121 INFO L481 AbstractCegarLoop]: Abstraction has 17120 states and 24327 transitions. [2018-10-24 23:36:18,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:36:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 17120 states and 24327 transitions. [2018-10-24 23:36:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-24 23:36:18,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:18,124 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:36:18,124 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:18,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 979871088, now seen corresponding path program 1 times [2018-10-24 23:36:18,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:18,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:18,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:18,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:18,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:18,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:36:18,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:36:18,323 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2018-10-24 23:36:18,325 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2743], [2745], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:36:18,387 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:36:18,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:36:19,569 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:36:19,571 INFO L272 AbstractInterpreter]: Visited 108 different actions 311 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-24 23:36:19,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:19,619 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:36:20,249 INFO L232 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 74.38% of their original sizes. [2018-10-24 23:36:20,250 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:36:21,011 INFO L413 sIntCurrentIteration]: We have 127 unified AI predicates [2018-10-24 23:36:21,011 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:36:21,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:36:21,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2018-10-24 23:36:21,012 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:21,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 23:36:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 23:36:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-24 23:36:21,013 INFO L87 Difference]: Start difference. First operand 17120 states and 24327 transitions. Second operand 14 states. [2018-10-24 23:36:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 23:36:32,622 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-10-24 23:36:32,629 INFO L168 Benchmark]: Toolchain (without parser) took 94477.70 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:32,630 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:36:32,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2458.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:32,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 571.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 831.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:32,633 INFO L168 Benchmark]: Boogie Preprocessor took 343.47 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:32,634 INFO L168 Benchmark]: RCFGBuilder took 11093.28 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 172.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 20.4 MB). Peak memory consumption was 655.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:32,635 INFO L168 Benchmark]: TraceAbstraction took 80005.79 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 555.2 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -281.3 MB). Peak memory consumption was 273.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:32,641 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2458.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 571.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 831.5 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 343.47 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11093.28 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 172.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 20.4 MB). Peak memory consumption was 655.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80005.79 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 555.2 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -281.3 MB). Peak memory consumption was 273.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...