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/Problem12_label10_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:31:27,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:31:27,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:31:27,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:31:27,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:31:27,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:31:27,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:31:27,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:31:27,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:31:27,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:31:27,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:31:27,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:31:27,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:31:27,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:31:27,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:31:27,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:31:27,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:31:27,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:31:27,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:31:27,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:31:27,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:31:27,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:31:27,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:31:27,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:31:27,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:31:27,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:31:27,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:31:27,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:31:27,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:31:27,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:31:27,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:31:27,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:31:27,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:31:27,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:31:27,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:31:27,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:31:27,507 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:31:27,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:31:27,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:31:27,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:31:27,536 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:31:27,536 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:31:27,537 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:31:27,537 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:31:27,537 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:31:27,537 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:31:27,537 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:31:27,538 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:31:27,538 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:31:27,538 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:31:27,538 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:31:27,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:31:27,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:31:27,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:31:27,539 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:31:27,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:31:27,540 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:31:27,540 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:31:27,540 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:31:27,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:31:27,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:31:27,541 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:31:27,541 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:31:27,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:31:27,541 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:31:27,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:31:27,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:31:27,542 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:31:27,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:31:27,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:31:27,542 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:31:27,543 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:31:27,543 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:31:27,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:31:27,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:31:27,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:31:27,623 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:31:27,623 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:31:27,624 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label10_false-unreach-call.c [2018-10-24 23:31:27,683 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e73144e0e/6d6f3ab8fd4b4da88811bac674379dd0/FLAGcf2e4167a [2018-10-24 23:31:28,462 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:31:28,463 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label10_false-unreach-call.c [2018-10-24 23:31:28,497 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e73144e0e/6d6f3ab8fd4b4da88811bac674379dd0/FLAGcf2e4167a [2018-10-24 23:31:28,519 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e73144e0e/6d6f3ab8fd4b4da88811bac674379dd0 [2018-10-24 23:31:28,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:31:28,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:31:28,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:31:28,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:31:28,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:31:28,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:31:28" (1/1) ... [2018-10-24 23:31:28,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a79e33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:28, skipping insertion in model container [2018-10-24 23:31:28,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:31:28" (1/1) ... [2018-10-24 23:31:28,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:31:28,718 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:31:29,906 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:31:29,911 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:31:30,574 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:31:30,610 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:31:30,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30 WrapperNode [2018-10-24 23:31:30,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:31:30,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:31:30,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:31:30,612 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:31:30,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:31:30" (1/1) ... [2018-10-24 23:31:30,687 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:31:30" (1/1) ... [2018-10-24 23:31:31,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:31:31,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:31:31,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:31:31,088 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:31:31,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (1/1) ... [2018-10-24 23:31:31,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (1/1) ... [2018-10-24 23:31:31,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (1/1) ... [2018-10-24 23:31:31,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (1/1) ... [2018-10-24 23:31:31,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (1/1) ... [2018-10-24 23:31:31,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (1/1) ... [2018-10-24 23:31:31,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (1/1) ... [2018-10-24 23:31:31,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:31:31,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:31:31,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:31:31,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:31:31,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (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:31:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:31:31,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:31:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:31:31,484 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:31:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:31:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:31:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:31:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:31:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:31:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:31:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:31:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:31:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:31:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:31:45,014 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:31:45,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:31:45 BoogieIcfgContainer [2018-10-24 23:31:45,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:31:45,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:31:45,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:31:45,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:31:45,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:31:28" (1/3) ... [2018-10-24 23:31:45,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcfd980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:31:45, skipping insertion in model container [2018-10-24 23:31:45,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:31:30" (2/3) ... [2018-10-24 23:31:45,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcfd980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:31:45, skipping insertion in model container [2018-10-24 23:31:45,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:31:45" (3/3) ... [2018-10-24 23:31:45,023 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label10_false-unreach-call.c [2018-10-24 23:31:45,032 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:31:45,040 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:31:45,057 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:31:45,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:31:45,103 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:31:45,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:31:45,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:31:45,104 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:31:45,104 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:31:45,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:31:45,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:31:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-24 23:31:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-24 23:31:45,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:31:45,153 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:31:45,156 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:31:45,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2120766700, now seen corresponding path program 1 times [2018-10-24 23:31:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:31:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:31:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:45,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:31:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:31:45,603 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:31:45,709 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:31:45,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:31:45,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:31:45,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:31:45,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:31:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:31:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:31:45,737 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-24 23:31:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:31:52,807 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-24 23:31:52,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:31:52,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-24 23:31:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:31:52,845 INFO L225 Difference]: With dead ends: 2446 [2018-10-24 23:31:52,846 INFO L226 Difference]: Without dead ends: 1604 [2018-10-24 23:31:52,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:31:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-24 23:31:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-24 23:31:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-24 23:31:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2861 transitions. [2018-10-24 23:31:53,041 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2861 transitions. Word has length 34 [2018-10-24 23:31:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:31:53,042 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2861 transitions. [2018-10-24 23:31:53,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:31:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2861 transitions. [2018-10-24 23:31:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-24 23:31:53,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:31:53,052 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:31:53,056 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:31:53,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:31:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1037709290, now seen corresponding path program 1 times [2018-10-24 23:31:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:31:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:31:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:31:53,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:31:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:31:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:31:53,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:31:53,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:31:53,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:31:53,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:31:53,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:31:53,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:31:53,412 INFO L87 Difference]: Start difference. First operand 1604 states and 2861 transitions. Second operand 4 states. [2018-10-24 23:32:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:09,757 INFO L93 Difference]: Finished difference Result 6274 states and 11427 transitions. [2018-10-24 23:32:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:32:09,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-24 23:32:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:09,796 INFO L225 Difference]: With dead ends: 6274 [2018-10-24 23:32:09,797 INFO L226 Difference]: Without dead ends: 4676 [2018-10-24 23:32:09,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:32:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2018-10-24 23:32:09,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4676. [2018-10-24 23:32:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2018-10-24 23:32:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 7992 transitions. [2018-10-24 23:32:09,980 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 7992 transitions. Word has length 110 [2018-10-24 23:32:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:09,981 INFO L481 AbstractCegarLoop]: Abstraction has 4676 states and 7992 transitions. [2018-10-24 23:32:09,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:32:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 7992 transitions. [2018-10-24 23:32:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-24 23:32:09,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:09,995 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:32:09,995 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:09,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1863697586, now seen corresponding path program 1 times [2018-10-24 23:32:09,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:09,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:09,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:09,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:10,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:10,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:32:10,406 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:10,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:32:10,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:32:10,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:32:10,407 INFO L87 Difference]: Start difference. First operand 4676 states and 7992 transitions. Second operand 5 states. [2018-10-24 23:32:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:20,582 INFO L93 Difference]: Finished difference Result 14214 states and 24823 transitions. [2018-10-24 23:32:20,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:32:20,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2018-10-24 23:32:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:20,642 INFO L225 Difference]: With dead ends: 14214 [2018-10-24 23:32:20,642 INFO L226 Difference]: Without dead ends: 9544 [2018-10-24 23:32:20,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:32:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2018-10-24 23:32:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9456. [2018-10-24 23:32:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9456 states. [2018-10-24 23:32:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9456 states to 9456 states and 14962 transitions. [2018-10-24 23:32:20,934 INFO L78 Accepts]: Start accepts. Automaton has 9456 states and 14962 transitions. Word has length 114 [2018-10-24 23:32:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:20,934 INFO L481 AbstractCegarLoop]: Abstraction has 9456 states and 14962 transitions. [2018-10-24 23:32:20,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:32:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 9456 states and 14962 transitions. [2018-10-24 23:32:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-24 23:32:20,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:20,937 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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:32:20,937 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:20,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2138795989, now seen corresponding path program 1 times [2018-10-24 23:32:20,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:20,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:20,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:21,185 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:32:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:21,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:32:21,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:21,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:32:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:32:21,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:32:21,489 INFO L87 Difference]: Start difference. First operand 9456 states and 14962 transitions. Second operand 6 states. [2018-10-24 23:32:21,623 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-24 23:32:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:35,281 INFO L93 Difference]: Finished difference Result 23116 states and 36972 transitions. [2018-10-24 23:32:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:32:35,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-24 23:32:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:35,337 INFO L225 Difference]: With dead ends: 23116 [2018-10-24 23:32:35,337 INFO L226 Difference]: Without dead ends: 13666 [2018-10-24 23:32:35,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:32:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13666 states. [2018-10-24 23:32:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13666 to 13631. [2018-10-24 23:32:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13631 states. [2018-10-24 23:32:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13631 states to 13631 states and 20923 transitions. [2018-10-24 23:32:35,712 INFO L78 Accepts]: Start accepts. Automaton has 13631 states and 20923 transitions. Word has length 125 [2018-10-24 23:32:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:35,712 INFO L481 AbstractCegarLoop]: Abstraction has 13631 states and 20923 transitions. [2018-10-24 23:32:35,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:32:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 13631 states and 20923 transitions. [2018-10-24 23:32:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-24 23:32:35,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:35,715 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:32:35,715 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:35,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash -46651346, now seen corresponding path program 1 times [2018-10-24 23:32:35,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:35,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:35,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:35,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:32:35,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:35,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:32:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:32:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:32:35,970 INFO L87 Difference]: Start difference. First operand 13631 states and 20923 transitions. Second operand 6 states. [2018-10-24 23:32:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:43,387 INFO L93 Difference]: Finished difference Result 37450 states and 60536 transitions. [2018-10-24 23:32:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:32:43,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-10-24 23:32:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:43,481 INFO L225 Difference]: With dead ends: 37450 [2018-10-24 23:32:43,481 INFO L226 Difference]: Without dead ends: 23825 [2018-10-24 23:32:43,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:32:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23825 states. [2018-10-24 23:32:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23825 to 23595. [2018-10-24 23:32:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23595 states. [2018-10-24 23:32:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23595 states to 23595 states and 36395 transitions. [2018-10-24 23:32:44,080 INFO L78 Accepts]: Start accepts. Automaton has 23595 states and 36395 transitions. Word has length 130 [2018-10-24 23:32:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:44,080 INFO L481 AbstractCegarLoop]: Abstraction has 23595 states and 36395 transitions. [2018-10-24 23:32:44,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:32:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 23595 states and 36395 transitions. [2018-10-24 23:32:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-24 23:32:44,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:44,084 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:32:44,084 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:44,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash -770376422, now seen corresponding path program 1 times [2018-10-24 23:32:44,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:44,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:44,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:44,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:44,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:32:44,413 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:44,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:32:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:32:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:32:44,414 INFO L87 Difference]: Start difference. First operand 23595 states and 36395 transitions. Second operand 5 states. [2018-10-24 23:33:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:03,587 INFO L93 Difference]: Finished difference Result 78582 states and 129545 transitions. [2018-10-24 23:33:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:33:03,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-10-24 23:33:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:03,815 INFO L225 Difference]: With dead ends: 78582 [2018-10-24 23:33:03,816 INFO L226 Difference]: Without dead ends: 54993 [2018-10-24 23:33:03,888 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:33:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54993 states. [2018-10-24 23:33:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54993 to 54565. [2018-10-24 23:33:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54565 states. [2018-10-24 23:33:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54565 states to 54565 states and 78237 transitions. [2018-10-24 23:33:05,084 INFO L78 Accepts]: Start accepts. Automaton has 54565 states and 78237 transitions. Word has length 156 [2018-10-24 23:33:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:05,085 INFO L481 AbstractCegarLoop]: Abstraction has 54565 states and 78237 transitions. [2018-10-24 23:33:05,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:33:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 54565 states and 78237 transitions. [2018-10-24 23:33:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-24 23:33:05,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:05,097 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:33:05,097 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:05,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash -899924151, now seen corresponding path program 1 times [2018-10-24 23:33:05,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:05,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:05,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:05,400 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 54 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:33:05,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:33:05,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:33:05,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-10-24 23:33:05,588 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2039], [2041], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2400], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2564], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:33:05,640 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:33:05,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:33:06,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:33:06,268 INFO L272 AbstractInterpreter]: Visited 126 different actions 126 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:33:06,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:06,313 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:33:07,370 INFO L232 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 75.26% of their original sizes. [2018-10-24 23:33:07,370 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:33:07,635 INFO L413 sIntCurrentIteration]: We have 234 unified AI predicates [2018-10-24 23:33:07,636 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:33:07,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:33:07,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:33:07,637 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:07,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:07,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:07,638 INFO L87 Difference]: Start difference. First operand 54565 states and 78237 transitions. Second operand 6 states. [2018-10-24 23:33:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:33:33,019 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: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.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: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.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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:33:33,024 INFO L168 Benchmark]: Toolchain (without parser) took 124490.35 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -941.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-24 23:33:33,026 INFO L168 Benchmark]: CDTParser took 0.20 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:33:33,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2074.41 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:33:33,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 475.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.8 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:33:33,028 INFO L168 Benchmark]: Boogie Preprocessor took 325.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:33:33,029 INFO L168 Benchmark]: RCFGBuilder took 13601.71 ms. Allocated memory was 2.3 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.4 GB in the end (delta: -155.9 MB). Peak memory consumption was 663.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:33:33,030 INFO L168 Benchmark]: TraceAbstraction took 108007.48 ms. Allocated memory was 2.5 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 22.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-24 23:33:33,036 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.20 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 2074.41 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 475.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.8 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 325.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13601.71 ms. Allocated memory was 2.3 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.4 GB in the end (delta: -155.9 MB). Peak memory consumption was 663.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108007.48 ms. Allocated memory was 2.5 GB in the beginning and 3.9 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 22.7 MB). Peak memory consumption was 1.5 GB. 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...