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_label28_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:32:04,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:32:04,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:32:04,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:32:04,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:32:04,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:32:04,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:32:04,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:32:04,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:32:04,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:32:04,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:32:04,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:32:04,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:32:04,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:32:04,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:32:04,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:32:04,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:32:04,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:32:04,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:32:04,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:32:04,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:32:04,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:32:04,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:32:04,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:32:04,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:32:04,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:32:04,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:32:04,535 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:32:04,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:32:04,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:32:04,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:32:04,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:32:04,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:32:04,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:32:04,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:32:04,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:32:04,540 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:32:04,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:32:04,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:32:04,557 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:32:04,557 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:32:04,557 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:32:04,557 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:32:04,558 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:32:04,558 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:32:04,558 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:32:04,558 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:32:04,558 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:32:04,559 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:32:04,559 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:32:04,559 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:32:04,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:32:04,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:32:04,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:32:04,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:32:04,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:32:04,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:32:04,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:32:04,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:32:04,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:32:04,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:32:04,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:32:04,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:32:04,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:32:04,563 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:32:04,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:32:04,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:32:04,563 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:32:04,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:32:04,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:32:04,564 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:32:04,564 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:32:04,564 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:32:04,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:32:04,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:32:04,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:32:04,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:32:04,630 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:32:04,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label28_false-unreach-call.c [2018-10-24 23:32:04,696 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d44d73d1f/443d3e5a013c42e7a2a3492749de35f2/FLAG7f6f2b1a9 [2018-10-24 23:32:05,531 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:32:05,532 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label28_false-unreach-call.c [2018-10-24 23:32:05,566 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d44d73d1f/443d3e5a013c42e7a2a3492749de35f2/FLAG7f6f2b1a9 [2018-10-24 23:32:05,588 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d44d73d1f/443d3e5a013c42e7a2a3492749de35f2 [2018-10-24 23:32:05,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:32:05,605 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:32:05,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:05,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:32:05,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:32:05,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:05" (1/1) ... [2018-10-24 23:32:05,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b5ccc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:05, skipping insertion in model container [2018-10-24 23:32:05,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:05" (1/1) ... [2018-10-24 23:32:05,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:32:05,801 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:32:07,152 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:07,157 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:32:07,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:07,863 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:32:07,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07 WrapperNode [2018-10-24 23:32:07,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:07,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:07,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:32:07,866 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:32:07,877 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:32:07" (1/1) ... [2018-10-24 23:32:07,945 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:32:07" (1/1) ... [2018-10-24 23:32:08,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:08,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:32:08,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:32:08,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:32:08,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (1/1) ... [2018-10-24 23:32:08,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (1/1) ... [2018-10-24 23:32:08,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (1/1) ... [2018-10-24 23:32:08,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (1/1) ... [2018-10-24 23:32:08,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (1/1) ... [2018-10-24 23:32:08,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (1/1) ... [2018-10-24 23:32:08,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (1/1) ... [2018-10-24 23:32:08,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:32:08,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:32:08,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:32:08,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:32:08,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (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:32:08,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:32:08,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:32:08,682 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:32:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:32:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:32:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:32:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:32:08,683 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:32:08,683 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:32:08,686 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:32:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:32:08,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:32:08,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:32:21,309 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:32:21,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:21 BoogieIcfgContainer [2018-10-24 23:32:21,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:32:21,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:32:21,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:32:21,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:32:21,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:32:05" (1/3) ... [2018-10-24 23:32:21,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e86a5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:21, skipping insertion in model container [2018-10-24 23:32:21,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:07" (2/3) ... [2018-10-24 23:32:21,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e86a5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:21, skipping insertion in model container [2018-10-24 23:32:21,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:21" (3/3) ... [2018-10-24 23:32:21,318 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label28_false-unreach-call.c [2018-10-24 23:32:21,328 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:32:21,338 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:32:21,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:32:21,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:32:21,402 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:32:21,402 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:32:21,402 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:32:21,402 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:32:21,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:32:21,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:32:21,403 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:32:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-24 23:32:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 23:32:21,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:21,453 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:32:21,455 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:21,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1508157813, now seen corresponding path program 1 times [2018-10-24 23:32:21,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:21,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:21,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:21,936 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 23:32:21,954 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:32:21,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:21,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:32:21,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:21,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:32:21,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:32:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:32:21,984 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-10-24 23:32:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:35,378 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-10-24 23:32:35,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:32:35,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-24 23:32:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:35,423 INFO L225 Difference]: With dead ends: 3234 [2018-10-24 23:32:35,423 INFO L226 Difference]: Without dead ends: 2388 [2018-10-24 23:32:35,435 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:32:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-24 23:32:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1604. [2018-10-24 23:32:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-24 23:32:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2600 transitions. [2018-10-24 23:32:35,606 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2600 transitions. Word has length 27 [2018-10-24 23:32:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:35,607 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2600 transitions. [2018-10-24 23:32:35,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:32:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2600 transitions. [2018-10-24 23:32:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-24 23:32:35,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:35,614 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] [2018-10-24 23:32:35,614 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:35,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1692088656, now seen corresponding path program 1 times [2018-10-24 23:32:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:35,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:36,117 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:32:36,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:36,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:32:36,118 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:36,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:32:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:32:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:32:36,123 INFO L87 Difference]: Start difference. First operand 1604 states and 2600 transitions. Second operand 5 states. [2018-10-24 23:32:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:32:48,818 INFO L93 Difference]: Finished difference Result 4873 states and 7923 transitions. [2018-10-24 23:32:48,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:32:48,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-10-24 23:32:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:32:48,854 INFO L225 Difference]: With dead ends: 4873 [2018-10-24 23:32:48,855 INFO L226 Difference]: Without dead ends: 3275 [2018-10-24 23:32:48,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:32:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2018-10-24 23:32:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3241. [2018-10-24 23:32:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2018-10-24 23:32:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4816 transitions. [2018-10-24 23:32:48,994 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4816 transitions. Word has length 107 [2018-10-24 23:32:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:32:48,995 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 4816 transitions. [2018-10-24 23:32:48,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:32:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4816 transitions. [2018-10-24 23:32:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-24 23:32:49,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:49,001 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:32:49,001 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:49,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:49,002 INFO L82 PathProgramCache]: Analyzing trace with hash 712593337, now seen corresponding path program 1 times [2018-10-24 23:32:49,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:49,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:49,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:49,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:49,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:49,342 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:32:49,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:49,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:32:49,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:49,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:32:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:32:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:32:49,344 INFO L87 Difference]: Start difference. First operand 3241 states and 4816 transitions. Second operand 6 states. [2018-10-24 23:33:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:06,776 INFO L93 Difference]: Finished difference Result 12870 states and 19656 transitions. [2018-10-24 23:33:06,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:06,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-24 23:33:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:06,838 INFO L225 Difference]: With dead ends: 12870 [2018-10-24 23:33:06,838 INFO L226 Difference]: Without dead ends: 9635 [2018-10-24 23:33:06,861 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:33:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2018-10-24 23:33:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 9567. [2018-10-24 23:33:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9567 states. [2018-10-24 23:33:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9567 states to 9567 states and 13823 transitions. [2018-10-24 23:33:07,137 INFO L78 Accepts]: Start accepts. Automaton has 9567 states and 13823 transitions. Word has length 136 [2018-10-24 23:33:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:07,138 INFO L481 AbstractCegarLoop]: Abstraction has 9567 states and 13823 transitions. [2018-10-24 23:33:07,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9567 states and 13823 transitions. [2018-10-24 23:33:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-24 23:33:07,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:07,148 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, 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:07,149 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:07,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 44914193, now seen corresponding path program 1 times [2018-10-24 23:33:07,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:07,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:07,387 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:07,440 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:33:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:07,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:07,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:07,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:07,442 INFO L87 Difference]: Start difference. First operand 9567 states and 13823 transitions. Second operand 6 states. [2018-10-24 23:33:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:15,618 INFO L93 Difference]: Finished difference Result 25915 states and 39231 transitions. [2018-10-24 23:33:15,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:15,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-24 23:33:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:15,710 INFO L225 Difference]: With dead ends: 25915 [2018-10-24 23:33:15,710 INFO L226 Difference]: Without dead ends: 16354 [2018-10-24 23:33:15,738 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:33:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16354 states. [2018-10-24 23:33:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16354 to 16174. [2018-10-24 23:33:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16174 states. [2018-10-24 23:33:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16174 states to 16174 states and 23344 transitions. [2018-10-24 23:33:16,170 INFO L78 Accepts]: Start accepts. Automaton has 16174 states and 23344 transitions. Word has length 148 [2018-10-24 23:33:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:16,173 INFO L481 AbstractCegarLoop]: Abstraction has 16174 states and 23344 transitions. [2018-10-24 23:33:16,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16174 states and 23344 transitions. [2018-10-24 23:33:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-24 23:33:16,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:16,176 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, 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:16,176 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:16,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 948159193, now seen corresponding path program 1 times [2018-10-24 23:33:16,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:16,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:16,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:16,453 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:16,722 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:33:16,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:16,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:16,723 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:16,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:16,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:16,724 INFO L87 Difference]: Start difference. First operand 16174 states and 23344 transitions. Second operand 6 states. [2018-10-24 23:33:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:27,176 INFO L93 Difference]: Finished difference Result 39076 states and 58115 transitions. [2018-10-24 23:33:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:27,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2018-10-24 23:33:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:27,275 INFO L225 Difference]: With dead ends: 39076 [2018-10-24 23:33:27,275 INFO L226 Difference]: Without dead ends: 22908 [2018-10-24 23:33:27,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:33:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22908 states. [2018-10-24 23:33:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22908 to 22784. [2018-10-24 23:33:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22784 states. [2018-10-24 23:33:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22784 states to 22784 states and 31228 transitions. [2018-10-24 23:33:27,979 INFO L78 Accepts]: Start accepts. Automaton has 22784 states and 31228 transitions. Word has length 152 [2018-10-24 23:33:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:27,980 INFO L481 AbstractCegarLoop]: Abstraction has 22784 states and 31228 transitions. [2018-10-24 23:33:27,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 22784 states and 31228 transitions. [2018-10-24 23:33:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 23:33:27,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:27,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,984 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:27,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 563531764, now seen corresponding path program 1 times [2018-10-24 23:33:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:27,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:27,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:28,307 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 23:33:28,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:33:28,587 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:33:28,588 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-10-24 23:33:28,592 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1983], [1985], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [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], [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], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:33:28,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:33:28,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:33:30,101 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:33:30,103 INFO L272 AbstractInterpreter]: Visited 153 different actions 300 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-24 23:33:30,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:30,153 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:33:31,574 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 78.8% of their original sizes. [2018-10-24 23:33:31,574 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:33:32,573 INFO L413 sIntCurrentIteration]: We have 172 unified AI predicates [2018-10-24 23:33:32,573 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:33:32,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:33:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 23:33:32,575 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:32,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 23:33:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 23:33:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-24 23:33:32,577 INFO L87 Difference]: Start difference. First operand 22784 states and 31228 transitions. Second operand 14 states. [2018-10-24 23:33:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 23:33:58,392 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:58,398 INFO L168 Benchmark]: Toolchain (without parser) took 112793.77 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -699.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-24 23:33:58,399 INFO L168 Benchmark]: CDTParser took 0.23 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:58,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2255.60 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:58,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 488.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 804.3 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 58.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:33:58,402 INFO L168 Benchmark]: Boogie Preprocessor took 251.27 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:33:58,402 INFO L168 Benchmark]: RCFGBuilder took 12704.48 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 167.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -156.6 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:33:58,404 INFO L168 Benchmark]: TraceAbstraction took 97085.58 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.4 GB in the beginning and 2.1 GB in the end (delta: 267.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-24 23:33:58,410 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.23 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 2255.60 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 488.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 804.3 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 58.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 251.27 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12704.48 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 167.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -156.6 MB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97085.58 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.4 GB in the beginning and 2.1 GB in the end (delta: 267.7 MB). Peak memory consumption was 1.4 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...