java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label58_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:36:58,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:36:58,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:36:58,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:36:58,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:36:58,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:36:58,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:36:58,547 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:36:58,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:36:58,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:36:58,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:36:58,551 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:36:58,552 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:36:58,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:36:58,555 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:36:58,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:36:58,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:36:58,559 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:36:58,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:36:58,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:36:58,565 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:36:58,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:36:58,570 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:36:58,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:36:58,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:36:58,571 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:36:58,572 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:36:58,573 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:36:58,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:36:58,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:36:58,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:36:58,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:36:58,577 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:36:58,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:36:58,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:36:58,579 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:36:58,580 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:36:58,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:36:58,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:36:58,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:36:58,598 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:36:58,598 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:36:58,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:36:58,598 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:36:58,599 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:36:58,599 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:36:58,599 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:36:58,600 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:36:58,600 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:36:58,600 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:36:58,600 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:36:58,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:36:58,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:36:58,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:36:58,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:36:58,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:36:58,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:36:58,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:36:58,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:36:58,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:36:58,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:36:58,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:36:58,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:36:58,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:36:58,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:36:58,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:36:58,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:36:58,606 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:36:58,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:36:58,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:36:58,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:36:58,607 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:36:58,607 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:36:58,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:36:58,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:36:58,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:36:58,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:36:58,683 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:36:58,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label58_false-unreach-call.c [2018-10-24 23:36:58,761 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/32b74b7e6/c5702bba351243a89f0a78be39cc7c03/FLAGeaa579234 [2018-10-24 23:36:59,594 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:36:59,595 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label58_false-unreach-call.c [2018-10-24 23:36:59,629 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/32b74b7e6/c5702bba351243a89f0a78be39cc7c03/FLAGeaa579234 [2018-10-24 23:36:59,652 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/32b74b7e6/c5702bba351243a89f0a78be39cc7c03 [2018-10-24 23:36:59,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:36:59,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:36:59,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:59,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:36:59,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:36:59,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:59" (1/1) ... [2018-10-24 23:36:59,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752afa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:59, skipping insertion in model container [2018-10-24 23:36:59,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:59" (1/1) ... [2018-10-24 23:36:59,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:36:59,876 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:37:01,222 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:37:01,227 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:37:01,952 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:37:01,995 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:37:01,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01 WrapperNode [2018-10-24 23:37:01,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:37:01,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:37:01,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:37:01,997 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:37:02,008 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:37:01" (1/1) ... [2018-10-24 23:37:02,094 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:37:01" (1/1) ... [2018-10-24 23:37:02,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:37:02,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:37:02,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:37:02,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:37:02,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (1/1) ... [2018-10-24 23:37:02,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (1/1) ... [2018-10-24 23:37:02,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (1/1) ... [2018-10-24 23:37:02,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (1/1) ... [2018-10-24 23:37:02,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (1/1) ... [2018-10-24 23:37:02,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (1/1) ... [2018-10-24 23:37:02,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (1/1) ... [2018-10-24 23:37:02,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:37:02,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:37:02,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:37:02,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:37:02,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (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:37:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:37:02,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:37:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:37:02,934 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:37:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:37:02,934 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:37:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:37:02,934 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:37:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:37:02,935 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:37:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:37:02,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:37:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:37:02,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:37:13,806 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:37:13,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:37:13 BoogieIcfgContainer [2018-10-24 23:37:13,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:37:13,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:37:13,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:37:13,811 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:37:13,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:36:59" (1/3) ... [2018-10-24 23:37:13,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790e6487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:37:13, skipping insertion in model container [2018-10-24 23:37:13,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:01" (2/3) ... [2018-10-24 23:37:13,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790e6487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:37:13, skipping insertion in model container [2018-10-24 23:37:13,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:37:13" (3/3) ... [2018-10-24 23:37:13,815 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label58_false-unreach-call.c [2018-10-24 23:37:13,825 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:37:13,835 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:37:13,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:37:13,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:37:13,915 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:37:13,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:37:13,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:37:13,916 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:37:13,916 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:37:13,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:37:13,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:37:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:37:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 23:37:13,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:13,974 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:37:13,977 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:13,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1597313123, now seen corresponding path program 1 times [2018-10-24 23:37:13,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:14,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:14,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:14,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:14,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:14,438 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:37:14,543 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:37:14,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:14,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:37:14,546 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:14,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:37:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:37:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:37:14,575 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-24 23:37:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:24,271 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-10-24 23:37:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:37:24,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 23:37:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:24,305 INFO L225 Difference]: With dead ends: 3097 [2018-10-24 23:37:24,305 INFO L226 Difference]: Without dead ends: 1975 [2018-10-24 23:37:24,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:37:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-10-24 23:37:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-10-24 23:37:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-10-24 23:37:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-10-24 23:37:24,474 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 19 [2018-10-24 23:37:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:24,474 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-10-24 23:37:24,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:37:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-10-24 23:37:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-24 23:37:24,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:24,481 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:37:24,481 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:24,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1812746414, now seen corresponding path program 1 times [2018-10-24 23:37:24,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:24,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:24,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:24,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:24,483 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:24,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:24,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:37:24,818 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:24,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:37:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:37:24,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:37:24,821 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-10-24 23:37:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:44,101 INFO L93 Difference]: Finished difference Result 5737 states and 9691 transitions. [2018-10-24 23:37:44,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:37:44,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-10-24 23:37:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:44,134 INFO L225 Difference]: With dead ends: 5737 [2018-10-24 23:37:44,135 INFO L226 Difference]: Without dead ends: 3769 [2018-10-24 23:37:44,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:37:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2018-10-24 23:37:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3685. [2018-10-24 23:37:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3685 states. [2018-10-24 23:37:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 5659 transitions. [2018-10-24 23:37:44,277 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 5659 transitions. Word has length 95 [2018-10-24 23:37:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:44,278 INFO L481 AbstractCegarLoop]: Abstraction has 3685 states and 5659 transitions. [2018-10-24 23:37:44,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:37:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 5659 transitions. [2018-10-24 23:37:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 23:37:44,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:44,284 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:37:44,284 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:44,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1681120082, now seen corresponding path program 1 times [2018-10-24 23:37:44,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:44,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:44,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:44,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:44,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:44,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:37:44,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:44,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:37:44,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:37:44,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:37:44,582 INFO L87 Difference]: Start difference. First operand 3685 states and 5659 transitions. Second operand 5 states. [2018-10-24 23:38:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:14,437 INFO L93 Difference]: Finished difference Result 13664 states and 21760 transitions. [2018-10-24 23:38:14,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:38:14,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-10-24 23:38:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:14,509 INFO L225 Difference]: With dead ends: 13664 [2018-10-24 23:38:14,509 INFO L226 Difference]: Without dead ends: 9985 [2018-10-24 23:38:14,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:38:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9985 states. [2018-10-24 23:38:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9985 to 9795. [2018-10-24 23:38:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9795 states. [2018-10-24 23:38:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 14501 transitions. [2018-10-24 23:38:14,805 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 14501 transitions. Word has length 109 [2018-10-24 23:38:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:14,806 INFO L481 AbstractCegarLoop]: Abstraction has 9795 states and 14501 transitions. [2018-10-24 23:38:14,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:38:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 14501 transitions. [2018-10-24 23:38:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 23:38:14,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:14,811 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:38:14,811 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:14,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1652720786, now seen corresponding path program 1 times [2018-10-24 23:38:14,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:14,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:14,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:14,813 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:15,107 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:38:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:15,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:15,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:15,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:15,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:15,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:15,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:15,301 INFO L87 Difference]: Start difference. First operand 9795 states and 14501 transitions. Second operand 6 states. [2018-10-24 23:38:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:28,735 INFO L93 Difference]: Finished difference Result 34191 states and 53807 transitions. [2018-10-24 23:38:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:28,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-24 23:38:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:28,862 INFO L225 Difference]: With dead ends: 34191 [2018-10-24 23:38:28,862 INFO L226 Difference]: Without dead ends: 24402 [2018-10-24 23:38:28,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:38:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24402 states. [2018-10-24 23:38:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24402 to 24175. [2018-10-24 23:38:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24175 states. [2018-10-24 23:38:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24175 states to 24175 states and 34092 transitions. [2018-10-24 23:38:29,502 INFO L78 Accepts]: Start accepts. Automaton has 24175 states and 34092 transitions. Word has length 127 [2018-10-24 23:38:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:29,502 INFO L481 AbstractCegarLoop]: Abstraction has 24175 states and 34092 transitions. [2018-10-24 23:38:29,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 24175 states and 34092 transitions. [2018-10-24 23:38:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-24 23:38:29,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:29,506 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:38:29,506 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:29,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:29,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1095351321, now seen corresponding path program 1 times [2018-10-24 23:38:29,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:29,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:29,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:29,508 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:29,773 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:38:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:30,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:30,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:30,172 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:30,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:30,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:30,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:30,174 INFO L87 Difference]: Start difference. First operand 24175 states and 34092 transitions. Second operand 6 states. [2018-10-24 23:38:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:40,952 INFO L93 Difference]: Finished difference Result 62356 states and 97936 transitions. [2018-10-24 23:38:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:40,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-24 23:38:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:41,124 INFO L225 Difference]: With dead ends: 62356 [2018-10-24 23:38:41,125 INFO L226 Difference]: Without dead ends: 38187 [2018-10-24 23:38:41,180 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-24 23:38:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38187 states. [2018-10-24 23:38:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38187 to 37985. [2018-10-24 23:38:42,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37985 states. [2018-10-24 23:38:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37985 states to 37985 states and 54458 transitions. [2018-10-24 23:38:42,121 INFO L78 Accepts]: Start accepts. Automaton has 37985 states and 54458 transitions. Word has length 138 [2018-10-24 23:38:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:42,122 INFO L481 AbstractCegarLoop]: Abstraction has 37985 states and 54458 transitions. [2018-10-24 23:38:42,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 37985 states and 54458 transitions. [2018-10-24 23:38:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-24 23:38:42,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:42,127 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:42,128 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:42,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1731803128, now seen corresponding path program 1 times [2018-10-24 23:38:42,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:42,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:42,434 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:38:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:42,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:42,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:42,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:42,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:42,833 INFO L87 Difference]: Start difference. First operand 37985 states and 54458 transitions. Second operand 6 states. [2018-10-24 23:38:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:51,813 INFO L93 Difference]: Finished difference Result 83946 states and 123880 transitions. [2018-10-24 23:38:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:51,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-10-24 23:38:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:51,985 INFO L225 Difference]: With dead ends: 83946 [2018-10-24 23:38:51,985 INFO L226 Difference]: Without dead ends: 45967 [2018-10-24 23:38:52,073 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-24 23:38:52,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45967 states. [2018-10-24 23:38:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45967 to 45865. [2018-10-24 23:38:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45865 states. [2018-10-24 23:38:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45865 states to 45865 states and 62685 transitions. [2018-10-24 23:38:52,985 INFO L78 Accepts]: Start accepts. Automaton has 45865 states and 62685 transitions. Word has length 166 [2018-10-24 23:38:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:52,986 INFO L481 AbstractCegarLoop]: Abstraction has 45865 states and 62685 transitions. [2018-10-24 23:38:52,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 45865 states and 62685 transitions. [2018-10-24 23:38:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 23:38:52,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:52,996 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-24 23:38:52,996 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:52,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash 456578613, now seen corresponding path program 1 times [2018-10-24 23:38:52,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:52,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:53,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:53,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:38:53,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:38:53,551 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-10-24 23:38:53,556 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2679], [2681], [2684], [2692], [2700], [2708], [2716], [2724], [2732], [2740], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:38:53,623 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:38:53,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:38:54,214 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:38:54,216 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:38:54,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:54,260 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:38:54,772 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 70.73% of their original sizes. [2018-10-24 23:38:54,772 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:38:54,937 INFO L413 sIntCurrentIteration]: We have 215 unified AI predicates [2018-10-24 23:38:54,938 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:38:54,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:38:54,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:38:54,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:54,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:54,940 INFO L87 Difference]: Start difference. First operand 45865 states and 62685 transitions. Second operand 6 states. [2018-10-24 23:38:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:38:59,210 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:38:59,215 INFO L168 Benchmark]: Toolchain (without parser) took 119549.13 ms. Allocated memory was 1.6 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -191.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-24 23:38:59,217 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:38:59,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2326.94 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:59,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 595.60 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 832.6 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 83.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:59,219 INFO L168 Benchmark]: Boogie Preprocessor took 276.00 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:59,220 INFO L168 Benchmark]: RCFGBuilder took 10937.99 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 183.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 20.1 MB). Peak memory consumption was 665.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:59,221 INFO L168 Benchmark]: TraceAbstraction took 105406.90 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 683.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 603.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 23:38:59,227 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2326.94 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 595.60 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 832.6 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 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 276.00 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10937.99 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 183.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 20.1 MB). Peak memory consumption was 665.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105406.90 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 683.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 603.0 MB). Peak memory consumption was 1.3 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...