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_label26_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:42:34,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:42:34,671 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:42:34,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:42:34,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:42:34,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:42:34,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:42:34,691 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:42:34,693 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:42:34,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:42:34,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:42:34,696 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:42:34,697 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:42:34,698 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:42:34,699 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:42:34,700 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:42:34,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:42:34,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:42:34,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:42:34,716 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:42:34,717 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:42:34,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:42:34,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:42:34,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:42:34,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:42:34,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:42:34,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:42:34,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:42:34,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:42:34,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:42:34,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:42:34,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:42:34,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:42:34,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:42:34,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:42:34,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:42:34,739 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:42:34,753 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:42:34,753 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:42:34,754 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:42:34,754 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:42:34,754 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:42:34,755 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:42:34,755 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:42:34,755 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:42:34,755 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:42:34,755 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:42:34,756 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:42:34,756 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:42:34,756 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:42:34,756 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:42:34,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:42:34,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:42:34,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:42:34,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:42:34,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:42:34,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:42:34,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:42:34,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:42:34,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:42:34,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:42:34,759 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:42:34,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:42:34,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:42:34,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:42:34,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:42:34,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:42:34,760 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:42:34,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:42:34,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:42:34,761 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:42:34,761 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:42:34,761 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:42:34,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:42:34,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:42:34,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:42:34,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:42:34,843 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:42:34,844 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c [2018-10-25 01:42:34,906 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3cd12df1f/04e46431c3d94d4a9184cac2cd4304cb/FLAG4465b0e63 [2018-10-25 01:42:35,727 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:42:35,728 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c [2018-10-25 01:42:35,768 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3cd12df1f/04e46431c3d94d4a9184cac2cd4304cb/FLAG4465b0e63 [2018-10-25 01:42:35,791 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3cd12df1f/04e46431c3d94d4a9184cac2cd4304cb [2018-10-25 01:42:35,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:42:35,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:42:35,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:42:35,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:42:35,814 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:42:35,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:42:35" (1/1) ... [2018-10-25 01:42:35,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d6e85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:35, skipping insertion in model container [2018-10-25 01:42:35,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:42:35" (1/1) ... [2018-10-25 01:42:35,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:42:36,048 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:42:37,528 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:42:37,538 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:42:38,182 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:42:38,213 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:42:38,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38 WrapperNode [2018-10-25 01:42:38,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:42:38,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:42:38,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:42:38,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:42:38,225 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:42:38" (1/1) ... [2018-10-25 01:42:38,311 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:42:38" (1/1) ... [2018-10-25 01:42:38,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:42:38,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:42:38,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:42:38,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:42:38,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (1/1) ... [2018-10-25 01:42:38,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (1/1) ... [2018-10-25 01:42:38,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (1/1) ... [2018-10-25 01:42:38,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (1/1) ... [2018-10-25 01:42:38,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (1/1) ... [2018-10-25 01:42:39,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (1/1) ... [2018-10-25 01:42:39,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (1/1) ... [2018-10-25 01:42:39,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:42:39,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:42:39,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:42:39,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:42:39,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (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:42:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:42:39,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:42:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:42:39,185 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:42:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:42:39,185 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:42:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:42:39,186 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:42:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:42:39,186 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:42:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:42:39,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:42:39,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:42:39,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:42:49,547 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:42:49,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:42:49 BoogieIcfgContainer [2018-10-25 01:42:49,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:42:49,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:42:49,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:42:49,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:42:49,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:42:35" (1/3) ... [2018-10-25 01:42:49,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a64050e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:42:49, skipping insertion in model container [2018-10-25 01:42:49,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:42:38" (2/3) ... [2018-10-25 01:42:49,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a64050e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:42:49, skipping insertion in model container [2018-10-25 01:42:49,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:42:49" (3/3) ... [2018-10-25 01:42:49,556 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label26_true-unreach-call.c [2018-10-25 01:42:49,566 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:42:49,577 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:42:49,595 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:42:49,644 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:42:49,645 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:42:49,645 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:42:49,645 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:42:49,645 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:42:49,645 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:42:49,645 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:42:49,646 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:42:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:42:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-25 01:42:49,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:49,696 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, 1, 1, 1, 1, 1] [2018-10-25 01:42:49,699 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:49,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1543659883, now seen corresponding path program 1 times [2018-10-25 01:42:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:49,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:49,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:50,228 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:42:50,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:50,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:42:50,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:50,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:42:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:42:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:42:50,255 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-25 01:43:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:03,826 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-10-25 01:43:03,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:43:03,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-10-25 01:43:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:03,894 INFO L225 Difference]: With dead ends: 3968 [2018-10-25 01:43:03,894 INFO L226 Difference]: Without dead ends: 2842 [2018-10-25 01:43:03,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:43:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-25 01:43:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-10-25 01:43:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-10-25 01:43:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-10-25 01:43:04,119 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 45 [2018-10-25 01:43:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:04,120 INFO L481 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-10-25 01:43:04,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:43:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-10-25 01:43:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-25 01:43:04,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:04,132 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, 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] [2018-10-25 01:43:04,133 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:04,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:04,133 INFO L82 PathProgramCache]: Analyzing trace with hash 369865390, now seen corresponding path program 1 times [2018-10-25 01:43:04,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:04,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:04,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:04,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:04,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:04,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:04,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:43:04,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:04,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:43:04,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:43:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:43:04,445 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-10-25 01:43:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:21,375 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-10-25 01:43:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:43:21,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-10-25 01:43:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:21,416 INFO L225 Difference]: With dead ends: 5673 [2018-10-25 01:43:21,416 INFO L226 Difference]: Without dead ends: 3698 [2018-10-25 01:43:21,424 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:43:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-10-25 01:43:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-10-25 01:43:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-10-25 01:43:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5871 transitions. [2018-10-25 01:43:21,560 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5871 transitions. Word has length 115 [2018-10-25 01:43:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:21,561 INFO L481 AbstractCegarLoop]: Abstraction has 3687 states and 5871 transitions. [2018-10-25 01:43:21,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:43:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5871 transitions. [2018-10-25 01:43:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-25 01:43:21,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:21,570 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, 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] [2018-10-25 01:43:21,570 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:21,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash 241566930, now seen corresponding path program 1 times [2018-10-25 01:43:21,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:21,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:21,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:21,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:43:21,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:21,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:43:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:43:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:43:21,784 INFO L87 Difference]: Start difference. First operand 3687 states and 5871 transitions. Second operand 5 states. [2018-10-25 01:43:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:37,131 INFO L93 Difference]: Finished difference Result 10963 states and 17868 transitions. [2018-10-25 01:43:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:43:37,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-10-25 01:43:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:37,170 INFO L225 Difference]: With dead ends: 10963 [2018-10-25 01:43:37,170 INFO L226 Difference]: Without dead ends: 7282 [2018-10-25 01:43:37,182 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-25 01:43:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2018-10-25 01:43:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7175. [2018-10-25 01:43:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7175 states. [2018-10-25 01:43:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 10522 transitions. [2018-10-25 01:43:37,417 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 10522 transitions. Word has length 117 [2018-10-25 01:43:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:37,418 INFO L481 AbstractCegarLoop]: Abstraction has 7175 states and 10522 transitions. [2018-10-25 01:43:37,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:43:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10522 transitions. [2018-10-25 01:43:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 01:43:37,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:37,427 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, 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-25 01:43:37,427 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:37,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:37,428 INFO L82 PathProgramCache]: Analyzing trace with hash 572519882, now seen corresponding path program 1 times [2018-10-25 01:43:37,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:37,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:37,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:37,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:37,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:37,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:37,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:43:37,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:37,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:43:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:43:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:43:37,693 INFO L87 Difference]: Start difference. First operand 7175 states and 10522 transitions. Second operand 4 states. [2018-10-25 01:43:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:43:50,149 INFO L93 Difference]: Finished difference Result 27675 states and 43307 transitions. [2018-10-25 01:43:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:43:50,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-10-25 01:43:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:43:50,252 INFO L225 Difference]: With dead ends: 27675 [2018-10-25 01:43:50,252 INFO L226 Difference]: Without dead ends: 20506 [2018-10-25 01:43:50,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:43:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20506 states. [2018-10-25 01:43:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20506 to 20467. [2018-10-25 01:43:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20467 states. [2018-10-25 01:43:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20467 states to 20467 states and 29135 transitions. [2018-10-25 01:43:50,843 INFO L78 Accepts]: Start accepts. Automaton has 20467 states and 29135 transitions. Word has length 161 [2018-10-25 01:43:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:43:50,844 INFO L481 AbstractCegarLoop]: Abstraction has 20467 states and 29135 transitions. [2018-10-25 01:43:50,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:43:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 20467 states and 29135 transitions. [2018-10-25 01:43:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-25 01:43:50,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:43:50,848 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, 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] [2018-10-25 01:43:50,849 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:43:50,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:43:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash 499433324, now seen corresponding path program 1 times [2018-10-25 01:43:50,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:43:50,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:50,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:43:50,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:43:50,854 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:43:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:43:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:43:51,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:43:51,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:43:51,109 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:43:51,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:43:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:43:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:43:51,111 INFO L87 Difference]: Start difference. First operand 20467 states and 29135 transitions. Second operand 4 states. [2018-10-25 01:44:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:44:02,093 INFO L93 Difference]: Finished difference Result 47396 states and 67722 transitions. [2018-10-25 01:44:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:44:02,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-25 01:44:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:44:02,212 INFO L225 Difference]: With dead ends: 47396 [2018-10-25 01:44:02,212 INFO L226 Difference]: Without dead ends: 26935 [2018-10-25 01:44:02,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:44:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26935 states. [2018-10-25 01:44:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26935 to 26934. [2018-10-25 01:44:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26934 states. [2018-10-25 01:44:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26934 states to 26934 states and 34386 transitions. [2018-10-25 01:44:02,864 INFO L78 Accepts]: Start accepts. Automaton has 26934 states and 34386 transitions. Word has length 166 [2018-10-25 01:44:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:44:02,864 INFO L481 AbstractCegarLoop]: Abstraction has 26934 states and 34386 transitions. [2018-10-25 01:44:02,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:44:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26934 states and 34386 transitions. [2018-10-25 01:44:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-25 01:44:02,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:44:02,879 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:44:02,879 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:44:02,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2012871233, now seen corresponding path program 1 times [2018-10-25 01:44:02,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:44:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:44:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:44:02,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:44:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:44:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:44:03,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:44:03,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:44:03,879 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-10-25 01:44:03,883 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2887], [2889], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3598], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:44:03,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:44:03,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:44:04,866 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:44:04,868 INFO L272 AbstractInterpreter]: Visited 170 different actions 170 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:44:04,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:44:04,912 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:44:05,808 INFO L232 lantSequenceWeakener]: Weakened 320 states. On average, predicates are now at 71.11% of their original sizes. [2018-10-25 01:44:05,809 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:44:06,059 INFO L413 sIntCurrentIteration]: We have 330 unified AI predicates [2018-10-25 01:44:06,059 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:44:06,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:44:06,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:44:06,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:44:06,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:44:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:44:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:44:06,062 INFO L87 Difference]: Start difference. First operand 26934 states and 34386 transitions. Second operand 6 states. [2018-10-25 01:44:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:44:10,436 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-25 01:44:10,442 INFO L168 Benchmark]: Toolchain (without parser) took 94637.22 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.2 MB). Peak memory consumption was 728.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:10,444 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:44:10,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2407.54 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: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:10,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 578.14 ms. Allocated memory was 1.5 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 73.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:10,447 INFO L168 Benchmark]: Boogie Preprocessor took 317.14 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.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:10,448 INFO L168 Benchmark]: RCFGBuilder took 10437.28 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 174.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.6 MB). Peak memory consumption was 663.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:10,449 INFO L168 Benchmark]: TraceAbstraction took 80891.79 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 524.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -16.8 MB). Peak memory consumption was 508.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:44:10,455 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2407.54 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: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 578.14 ms. Allocated memory was 1.5 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 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 317.14 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.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10437.28 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 174.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.6 MB). Peak memory consumption was 663.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80891.79 ms. Allocated memory was 2.5 GB in the beginning and 3.1 GB in the end (delta: 524.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -16.8 MB). Peak memory consumption was 508.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...