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_label54_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:39:46,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:39:46,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:39:46,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:39:46,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:39:46,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:39:46,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:39:46,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:39:46,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:39:46,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:39:46,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:39:46,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:39:46,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:39:46,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:39:46,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:39:46,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:39:46,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:39:46,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:39:46,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:39:46,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:39:46,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:39:46,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:39:46,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:39:46,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:39:46,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:39:46,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:39:46,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:39:46,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:39:46,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:39:46,496 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:39:46,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:39:46,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:39:46,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:39:46,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:39:46,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:39:46,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:39:46,500 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-25 01:39:46,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:39:46,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:39:46,527 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:39:46,527 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:39:46,527 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:39:46,527 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:39:46,528 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:39:46,528 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:39:46,528 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:39:46,528 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:39:46,528 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:39:46,528 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:39:46,529 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:39:46,529 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:39:46,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:39:46,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:39:46,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:39:46,530 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:39:46,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:39:46,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:39:46,534 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:39:46,534 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:39:46,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:39:46,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:39:46,535 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:39:46,535 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:39:46,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:39:46,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:39:46,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:39:46,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:39:46,536 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:39:46,536 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:39:46,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:39:46,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:39:46,537 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:39:46,537 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:39:46,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:39:46,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:39:46,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:39:46,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:39:46,606 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:39:46,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label54_true-unreach-call.c [2018-10-25 01:39:46,682 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ec5f399dd/6267ef58c1c64394a5dd2e5a5d4e3284/FLAGcbbfa5e99 [2018-10-25 01:39:47,505 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:39:47,506 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label54_true-unreach-call.c [2018-10-25 01:39:47,538 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ec5f399dd/6267ef58c1c64394a5dd2e5a5d4e3284/FLAGcbbfa5e99 [2018-10-25 01:39:47,555 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ec5f399dd/6267ef58c1c64394a5dd2e5a5d4e3284 [2018-10-25 01:39:47,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:39:47,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:39:47,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:39:47,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:39:47,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:39:47,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:39:47" (1/1) ... [2018-10-25 01:39:47,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b326c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:47, skipping insertion in model container [2018-10-25 01:39:47,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:39:47" (1/1) ... [2018-10-25 01:39:47,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:39:47,775 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:39:49,118 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:39:49,123 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:39:49,760 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:39:49,792 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:39:49,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49 WrapperNode [2018-10-25 01:39:49,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:39:49,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:39:49,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:39:49,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:39:49,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:49,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:39:50,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:39:50,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:39:50,254 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:39:50,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (1/1) ... [2018-10-25 01:39:50,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:39:50,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:39:50,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:39:50,596 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:39:50,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (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-25 01:39:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:39:50,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:39:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:39:50,673 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:39:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:39:50,674 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:39:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:39:50,674 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:39:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:39:50,676 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:39:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:39:50,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:39:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:39:50,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:40:02,877 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:40:02,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:02 BoogieIcfgContainer [2018-10-25 01:40:02,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:40:02,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:40:02,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:40:02,882 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:40:02,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:39:47" (1/3) ... [2018-10-25 01:40:02,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b73a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:02, skipping insertion in model container [2018-10-25 01:40:02,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:49" (2/3) ... [2018-10-25 01:40:02,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b73a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:40:02, skipping insertion in model container [2018-10-25 01:40:02,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:40:02" (3/3) ... [2018-10-25 01:40:02,886 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label54_true-unreach-call.c [2018-10-25 01:40:02,896 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:40:02,905 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:40:02,921 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:40:02,965 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:40:02,965 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:40:02,965 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:40:02,965 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:40:02,966 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:40:02,966 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:40:02,966 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:40:02,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:40:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:40:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-25 01:40:03,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:03,021 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, 1, 1, 1, 1, 1, 1] [2018-10-25 01:40:03,023 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:03,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2139876300, now seen corresponding path program 1 times [2018-10-25 01:40:03,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:03,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:03,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:03,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:03,530 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:03,646 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-25 01:40:03,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:03,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:40:03,650 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:03,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:40:03,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:40:03,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:40:03,676 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:40:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:14,132 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:40:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:40:14,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-25 01:40:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:14,184 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:40:14,184 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:40:14,202 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-25 01:40:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:40:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:40:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:40:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2909 transitions. [2018-10-25 01:40:14,421 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2909 transitions. Word has length 40 [2018-10-25 01:40:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:14,422 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2909 transitions. [2018-10-25 01:40:14,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:40:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2909 transitions. [2018-10-25 01:40:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-25 01:40:14,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:14,436 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, 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] [2018-10-25 01:40:14,436 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:14,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1482898002, now seen corresponding path program 1 times [2018-10-25 01:40:14,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:14,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:14,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:14,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:40:14,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:14,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:40:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:40:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:40:14,771 INFO L87 Difference]: Start difference. First operand 1604 states and 2909 transitions. Second operand 5 states. [2018-10-25 01:40:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:25,749 INFO L93 Difference]: Finished difference Result 4818 states and 8826 transitions. [2018-10-25 01:40:25,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:40:25,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2018-10-25 01:40:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:25,773 INFO L225 Difference]: With dead ends: 4818 [2018-10-25 01:40:25,773 INFO L226 Difference]: Without dead ends: 3220 [2018-10-25 01:40:25,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:40:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2018-10-25 01:40:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3186. [2018-10-25 01:40:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-10-25 01:40:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 5594 transitions. [2018-10-25 01:40:25,906 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 5594 transitions. Word has length 114 [2018-10-25 01:40:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:25,907 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 5594 transitions. [2018-10-25 01:40:25,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:40:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 5594 transitions. [2018-10-25 01:40:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-25 01:40:25,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:25,912 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, 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] [2018-10-25 01:40:25,912 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:25,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1633492773, now seen corresponding path program 1 times [2018-10-25 01:40:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:25,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:25,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:25,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:25,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:26,275 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:26,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:26,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:26,651 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:26,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:26,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:26,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:26,654 INFO L87 Difference]: Start difference. First operand 3186 states and 5594 transitions. Second operand 6 states. [2018-10-25 01:40:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:43,089 INFO L93 Difference]: Finished difference Result 11148 states and 19850 transitions. [2018-10-25 01:40:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:40:43,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-10-25 01:40:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:43,150 INFO L225 Difference]: With dead ends: 11148 [2018-10-25 01:40:43,150 INFO L226 Difference]: Without dead ends: 7968 [2018-10-25 01:40:43,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:40:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7968 states. [2018-10-25 01:40:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7968 to 7924. [2018-10-25 01:40:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2018-10-25 01:40:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13424 transitions. [2018-10-25 01:40:43,432 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13424 transitions. Word has length 119 [2018-10-25 01:40:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:43,432 INFO L481 AbstractCegarLoop]: Abstraction has 7924 states and 13424 transitions. [2018-10-25 01:40:43,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13424 transitions. [2018-10-25 01:40:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 01:40:43,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:43,442 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:40:43,442 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:43,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1525604427, now seen corresponding path program 1 times [2018-10-25 01:40:43,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:43,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:43,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:43,763 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:43,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:43,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:43,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:43,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:43,859 INFO L87 Difference]: Start difference. First operand 7924 states and 13424 transitions. Second operand 6 states. [2018-10-25 01:40:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:55,107 INFO L93 Difference]: Finished difference Result 22224 states and 38004 transitions. [2018-10-25 01:40:55,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:40:55,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-25 01:40:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:55,180 INFO L225 Difference]: With dead ends: 22224 [2018-10-25 01:40:55,181 INFO L226 Difference]: Without dead ends: 14306 [2018-10-25 01:40:55,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:40:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14306 states. [2018-10-25 01:40:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14306 to 14219. [2018-10-25 01:40:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14219 states. [2018-10-25 01:40:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14219 states to 14219 states and 21550 transitions. [2018-10-25 01:40:55,581 INFO L78 Accepts]: Start accepts. Automaton has 14219 states and 21550 transitions. Word has length 127 [2018-10-25 01:40:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:55,581 INFO L481 AbstractCegarLoop]: Abstraction has 14219 states and 21550 transitions. [2018-10-25 01:40:55,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 14219 states and 21550 transitions. [2018-10-25 01:40:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 01:40:55,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:55,585 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, 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] [2018-10-25 01:40:55,586 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:55,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash -654123146, now seen corresponding path program 1 times [2018-10-25 01:40:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:55,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:55,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:55,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:55,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:55,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:55,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:55,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:55,771 INFO L87 Difference]: Start difference. First operand 14219 states and 21550 transitions. Second operand 6 states. [2018-10-25 01:41:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:19,567 INFO L93 Difference]: Finished difference Result 56456 states and 95976 transitions. [2018-10-25 01:41:19,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:41:19,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-10-25 01:41:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:19,828 INFO L225 Difference]: With dead ends: 56456 [2018-10-25 01:41:19,829 INFO L226 Difference]: Without dead ends: 42243 [2018-10-25 01:41:19,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:41:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42243 states. [2018-10-25 01:41:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42243 to 42003. [2018-10-25 01:41:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42003 states. [2018-10-25 01:41:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42003 states to 42003 states and 62980 transitions. [2018-10-25 01:41:21,487 INFO L78 Accepts]: Start accepts. Automaton has 42003 states and 62980 transitions. Word has length 144 [2018-10-25 01:41:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:21,488 INFO L481 AbstractCegarLoop]: Abstraction has 42003 states and 62980 transitions. [2018-10-25 01:41:21,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42003 states and 62980 transitions. [2018-10-25 01:41:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-25 01:41:21,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:21,495 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, 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] [2018-10-25 01:41:21,495 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:21,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -271525473, now seen corresponding path program 1 times [2018-10-25 01:41:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:21,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:21,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:21,766 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:22,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:22,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:22,199 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:22,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:22,201 INFO L87 Difference]: Start difference. First operand 42003 states and 62980 transitions. Second operand 6 states. [2018-10-25 01:41:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:38,175 INFO L93 Difference]: Finished difference Result 104625 states and 165914 transitions. [2018-10-25 01:41:38,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:38,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-10-25 01:41:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:38,385 INFO L225 Difference]: With dead ends: 104625 [2018-10-25 01:41:38,385 INFO L226 Difference]: Without dead ends: 62628 [2018-10-25 01:41:38,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:41:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62628 states. [2018-10-25 01:41:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62628 to 62378. [2018-10-25 01:41:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62378 states. [2018-10-25 01:41:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62378 states to 62378 states and 87792 transitions. [2018-10-25 01:41:39,692 INFO L78 Accepts]: Start accepts. Automaton has 62378 states and 87792 transitions. Word has length 165 [2018-10-25 01:41:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:39,693 INFO L481 AbstractCegarLoop]: Abstraction has 62378 states and 87792 transitions. [2018-10-25 01:41:39,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 62378 states and 87792 transitions. [2018-10-25 01:41:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-25 01:41:39,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:39,703 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:41:39,703 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:39,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash 708461889, now seen corresponding path program 1 times [2018-10-25 01:41:39,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:39,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:39,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:39,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:39,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 66 proven. 74 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:41:39,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:41:39,891 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:41:39,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-10-25 01:41:39,894 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], [2043], [2051], [2059], [2067], [2075], [2083], [2087], [2089], [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], [2396], [2397], [2400], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:41:39,949 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:41:39,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:41:40,596 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:41:40,604 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:41:40,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:40,649 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:41:41,280 INFO L232 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 75.44% of their original sizes. [2018-10-25 01:41:41,281 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:41:41,528 INFO L413 sIntCurrentIteration]: We have 198 unified AI predicates [2018-10-25 01:41:41,528 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:41:41,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:41:41,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:41:41,533 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:41,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:41,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:41,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:41,534 INFO L87 Difference]: Start difference. First operand 62378 states and 87792 transitions. Second operand 6 states. [2018-10-25 01:41:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:41:48,797 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:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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-25 01:41:48,802 INFO L168 Benchmark]: Toolchain (without parser) took 121231.57 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -542.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:41:48,804 INFO L168 Benchmark]: CDTParser took 0.21 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-25 01:41:48,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2219.05 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-25 01:41:48,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 459.75 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:48,806 INFO L168 Benchmark]: Boogie Preprocessor took 341.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:48,807 INFO L168 Benchmark]: RCFGBuilder took 12282.84 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 156.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -140.7 MB). Peak memory consumption was 652.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:48,808 INFO L168 Benchmark]: TraceAbstraction took 105922.54 ms. Allocated memory was 2.5 GB in the beginning and 3.3 GB in the end (delta: 787.5 MB). Free memory was 2.4 GB in the beginning and 2.0 GB in the end (delta: 418.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:41:48,814 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.21 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 2219.05 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 459.75 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 814.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 341.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12282.84 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 156.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -140.7 MB). Peak memory consumption was 652.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105922.54 ms. Allocated memory was 2.5 GB in the beginning and 3.3 GB in the end (delta: 787.5 MB). Free memory was 2.4 GB in the beginning and 2.0 GB in the end (delta: 418.9 MB). Peak memory consumption was 1.2 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...