java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label37_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:32:37,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:32:37,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:32:37,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:32:37,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:32:37,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:32:37,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:32:37,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:32:37,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:32:37,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:32:37,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:32:37,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:32:37,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:32:37,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:32:37,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:32:37,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:32:37,706 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:32:37,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:32:37,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:32:37,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:32:37,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:32:37,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:32:37,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:32:37,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:32:37,729 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:32:37,730 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:32:37,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:32:37,731 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:32:37,732 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:32:37,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:32:37,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:32:37,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:32:37,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:32:37,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:32:37,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:32:37,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:32:37,737 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:32:37,759 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:32:37,759 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:32:37,760 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:32:37,760 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:32:37,760 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:32:37,760 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:32:37,761 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:32:37,761 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:32:37,762 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:32:37,762 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:32:37,762 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:32:37,762 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:32:37,762 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:32:37,762 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:32:37,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:32:37,764 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:32:37,764 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:32:37,764 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:32:37,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:32:37,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:32:37,765 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:32:37,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:32:37,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:32:37,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:32:37,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:32:37,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:32:37,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:32:37,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:32:37,768 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:32:37,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:32:37,768 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:32:37,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:32:37,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:32:37,769 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:32:37,769 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:32:37,769 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:32:37,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:32:37,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:32:37,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:32:37,833 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:32:37,833 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:32:37,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label37_false-unreach-call.c [2018-10-24 23:32:37,892 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/48ace3e39/24129d528c794a378ee151584d875513/FLAG7c16bb2ed [2018-10-24 23:32:38,586 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:32:38,587 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label37_false-unreach-call.c [2018-10-24 23:32:38,614 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/48ace3e39/24129d528c794a378ee151584d875513/FLAG7c16bb2ed [2018-10-24 23:32:38,630 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/48ace3e39/24129d528c794a378ee151584d875513 [2018-10-24 23:32:38,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:32:38,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:32:38,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:38,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:32:38,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:32:38,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:38" (1/1) ... [2018-10-24 23:32:38,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc12248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:38, skipping insertion in model container [2018-10-24 23:32:38,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:32:38" (1/1) ... [2018-10-24 23:32:38,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:32:38,836 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:32:40,077 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:40,084 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:32:40,719 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:32:40,750 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:32:40,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40 WrapperNode [2018-10-24 23:32:40,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:32:40,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:40,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:32:40,752 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:32:40,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:40,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:32:41,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:32:41,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:32:41,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:32:41,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... [2018-10-24 23:32:41,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:32:41,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:32:41,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:32:41,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:32:41,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:32:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:32:41,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:32:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:32:41,557 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:32:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:32:41,557 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:32:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:32:41,557 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:32:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:32:41,558 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:32:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:32:41,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:32:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:32:41,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:32:53,116 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:32:53,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:53 BoogieIcfgContainer [2018-10-24 23:32:53,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:32:53,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:32:53,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:32:53,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:32:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:32:38" (1/3) ... [2018-10-24 23:32:53,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24eb2c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:53, skipping insertion in model container [2018-10-24 23:32:53,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:32:40" (2/3) ... [2018-10-24 23:32:53,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24eb2c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:32:53, skipping insertion in model container [2018-10-24 23:32:53,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:32:53" (3/3) ... [2018-10-24 23:32:53,125 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label37_false-unreach-call.c [2018-10-24 23:32:53,135 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:32:53,145 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:32:53,162 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:32:53,209 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:32:53,209 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:32:53,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:32:53,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:32:53,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:32:53,210 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:32:53,210 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:32:53,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:32:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-24 23:32:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 23:32:53,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:32:53,258 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] [2018-10-24 23:32:53,261 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:32:53,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:32:53,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2022607172, now seen corresponding path program 1 times [2018-10-24 23:32:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:32:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:32:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:32:53,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:32:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:32:53,660 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:32:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:32:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:32:53,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:32:53,771 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:32:53,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:32:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:32:53,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:32:53,803 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-24 23:33:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:02,146 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-24 23:33:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:33:02,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-24 23:33:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:02,185 INFO L225 Difference]: With dead ends: 2446 [2018-10-24 23:33:02,186 INFO L226 Difference]: Without dead ends: 1604 [2018-10-24 23:33:02,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:33:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-24 23:33:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-24 23:33:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-24 23:33:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2861 transitions. [2018-10-24 23:33:02,372 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2861 transitions. Word has length 20 [2018-10-24 23:33:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:02,373 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2861 transitions. [2018-10-24 23:33:02,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:33:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2861 transitions. [2018-10-24 23:33:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-24 23:33:02,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:02,383 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:33:02,384 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:02,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1778417694, now seen corresponding path program 1 times [2018-10-24 23:33:02,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:02,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:02,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:02,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:02,388 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:02,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:33:02,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:02,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:33:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:33:02,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:02,716 INFO L87 Difference]: Start difference. First operand 1604 states and 2861 transitions. Second operand 4 states. [2018-10-24 23:33:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:16,503 INFO L93 Difference]: Finished difference Result 6274 states and 11427 transitions. [2018-10-24 23:33:16,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:33:16,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-10-24 23:33:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:16,545 INFO L225 Difference]: With dead ends: 6274 [2018-10-24 23:33:16,546 INFO L226 Difference]: Without dead ends: 4676 [2018-10-24 23:33:16,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:33:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2018-10-24 23:33:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4676. [2018-10-24 23:33:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2018-10-24 23:33:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 7992 transitions. [2018-10-24 23:33:16,725 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 7992 transitions. Word has length 96 [2018-10-24 23:33:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:16,726 INFO L481 AbstractCegarLoop]: Abstraction has 4676 states and 7992 transitions. [2018-10-24 23:33:16,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:33:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 7992 transitions. [2018-10-24 23:33:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 23:33:16,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:16,732 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:33:16,732 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:16,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1546584746, now seen corresponding path program 1 times [2018-10-24 23:33:16,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:16,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:16,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:16,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:33:16,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:16,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:33:16,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:33:16,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:33:16,961 INFO L87 Difference]: Start difference. First operand 4676 states and 7992 transitions. Second operand 5 states. [2018-10-24 23:33:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:28,112 INFO L93 Difference]: Finished difference Result 14214 states and 24823 transitions. [2018-10-24 23:33:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:33:28,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-10-24 23:33:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:28,180 INFO L225 Difference]: With dead ends: 14214 [2018-10-24 23:33:28,180 INFO L226 Difference]: Without dead ends: 9544 [2018-10-24 23:33:28,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9544 states. [2018-10-24 23:33:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9544 to 9456. [2018-10-24 23:33:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9456 states. [2018-10-24 23:33:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9456 states to 9456 states and 14962 transitions. [2018-10-24 23:33:28,494 INFO L78 Accepts]: Start accepts. Automaton has 9456 states and 14962 transitions. Word has length 100 [2018-10-24 23:33:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:28,495 INFO L481 AbstractCegarLoop]: Abstraction has 9456 states and 14962 transitions. [2018-10-24 23:33:28,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:33:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 9456 states and 14962 transitions. [2018-10-24 23:33:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-24 23:33:28,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:28,498 INFO L375 BasicCegarLoop]: trace histogram [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-24 23:33:28,499 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:28,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash 36653875, now seen corresponding path program 1 times [2018-10-24 23:33:28,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:28,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:28,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:28,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:28,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:28,781 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:29,192 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:29,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:29,194 INFO L87 Difference]: Start difference. First operand 9456 states and 14962 transitions. Second operand 6 states. [2018-10-24 23:33:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:44,455 INFO L93 Difference]: Finished difference Result 22341 states and 35510 transitions. [2018-10-24 23:33:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:33:44,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-10-24 23:33:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:44,516 INFO L225 Difference]: With dead ends: 22341 [2018-10-24 23:33:44,516 INFO L226 Difference]: Without dead ends: 12891 [2018-10-24 23:33:44,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:33:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2018-10-24 23:33:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12853. [2018-10-24 23:33:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12853 states. [2018-10-24 23:33:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12853 states to 12853 states and 19480 transitions. [2018-10-24 23:33:44,854 INFO L78 Accepts]: Start accepts. Automaton has 12853 states and 19480 transitions. Word has length 111 [2018-10-24 23:33:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:44,855 INFO L481 AbstractCegarLoop]: Abstraction has 12853 states and 19480 transitions. [2018-10-24 23:33:44,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12853 states and 19480 transitions. [2018-10-24 23:33:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-24 23:33:44,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:44,863 INFO L375 BasicCegarLoop]: trace histogram [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-24 23:33:44,863 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:44,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash 586101302, now seen corresponding path program 1 times [2018-10-24 23:33:44,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:44,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:44,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:44,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:44,865 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:45,152 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:33:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:45,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:45,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:33:45,538 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:45,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:33:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:33:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:33:45,541 INFO L87 Difference]: Start difference. First operand 12853 states and 19480 transitions. Second operand 6 states. [2018-10-24 23:33:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:33:54,694 INFO L93 Difference]: Finished difference Result 35894 states and 57485 transitions. [2018-10-24 23:33:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:33:54,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-10-24 23:33:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:33:54,785 INFO L225 Difference]: With dead ends: 35894 [2018-10-24 23:33:54,785 INFO L226 Difference]: Without dead ends: 23047 [2018-10-24 23:33:54,821 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:33:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23047 states. [2018-10-24 23:33:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23047 to 22805. [2018-10-24 23:33:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22805 states. [2018-10-24 23:33:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22805 states to 22805 states and 34896 transitions. [2018-10-24 23:33:55,365 INFO L78 Accepts]: Start accepts. Automaton has 22805 states and 34896 transitions. Word has length 116 [2018-10-24 23:33:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:33:55,366 INFO L481 AbstractCegarLoop]: Abstraction has 22805 states and 34896 transitions. [2018-10-24 23:33:55,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:33:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22805 states and 34896 transitions. [2018-10-24 23:33:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 23:33:55,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:33:55,368 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:33:55,368 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:33:55,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:33:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash -220169182, now seen corresponding path program 1 times [2018-10-24 23:33:55,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:33:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:55,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:33:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:33:55,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:33:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:33:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:33:55,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:33:55,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:33:55,676 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:33:55,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:33:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:33:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:33:55,678 INFO L87 Difference]: Start difference. First operand 22805 states and 34896 transitions. Second operand 5 states. [2018-10-24 23:34:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:34:18,174 INFO L93 Difference]: Finished difference Result 76291 states and 124667 transitions. [2018-10-24 23:34:18,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:34:18,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-24 23:34:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:34:18,376 INFO L225 Difference]: With dead ends: 76291 [2018-10-24 23:34:18,376 INFO L226 Difference]: Without dead ends: 53492 [2018-10-24 23:34:18,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:34:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53492 states. [2018-10-24 23:34:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53492 to 53063. [2018-10-24 23:34:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53063 states. [2018-10-24 23:34:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53063 states to 53063 states and 75540 transitions. [2018-10-24 23:34:19,602 INFO L78 Accepts]: Start accepts. Automaton has 53063 states and 75540 transitions. Word has length 142 [2018-10-24 23:34:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:34:19,603 INFO L481 AbstractCegarLoop]: Abstraction has 53063 states and 75540 transitions. [2018-10-24 23:34:19,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:34:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 53063 states and 75540 transitions. [2018-10-24 23:34:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-24 23:34:19,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:34:19,610 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:19,610 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:34:19,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash -387409999, now seen corresponding path program 1 times [2018-10-24 23:34:19,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:34:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:19,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:34:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:19,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:34:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:34:19,886 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:34:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:34:19,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:34:19,951 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:34:19,952 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-10-24 23:34:19,954 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1927], [1929], [1932], [1940], [1948], [1956], [1964], [1972], [1980], [1988], [1996], [2004], [2012], [2020], [2028], [2036], [2044], [2052], [2060], [2068], [2076], [2084], [2092], [2100], [2108], [2116], [2124], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2400], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2564], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-24 23:34:20,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:34:20,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:34:20,556 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:34:20,558 INFO L272 AbstractInterpreter]: Visited 126 different actions 126 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:34:20,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:20,603 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:34:21,176 INFO L232 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 75% of their original sizes. [2018-10-24 23:34:21,176 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:34:21,421 INFO L413 sIntCurrentIteration]: We have 220 unified AI predicates [2018-10-24 23:34:21,424 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:34:21,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:34:21,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:34:21,426 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:34:21,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:34:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:34:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:34:21,427 INFO L87 Difference]: Start difference. First operand 53063 states and 75540 transitions. Second operand 6 states. [2018-10-24 23:34:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:34:54,346 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:34:54,352 INFO L168 Benchmark]: Toolchain (without parser) took 135708.44 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 23:34:54,353 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:34:54,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2105.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:54,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 467.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 807.4 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:54,355 INFO L168 Benchmark]: Boogie Preprocessor took 262.56 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:54,356 INFO L168 Benchmark]: RCFGBuilder took 11635.18 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 169.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -174.1 MB). Peak memory consumption was 662.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:34:54,357 INFO L168 Benchmark]: TraceAbstraction took 121232.94 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 78.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-24 23:34:54,363 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.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2105.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 467.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 807.4 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 262.56 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11635.18 ms. Allocated memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: 169.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -174.1 MB). Peak memory consumption was 662.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121232.94 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 78.4 MB). Peak memory consumption was 1.6 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...