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/Problem16_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:51:43,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:51:43,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:51:43,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:51:43,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:51:43,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:51:43,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:51:43,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:51:43,156 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:51:43,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:51:43,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:51:43,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:51:43,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:51:43,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:51:43,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:51:43,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:51:43,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:51:43,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:51:43,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:51:43,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:51:43,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:51:43,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:51:43,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:51:43,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:51:43,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:51:43,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:51:43,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:51:43,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:51:43,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:51:43,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:51:43,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:51:43,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:51:43,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:51:43,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:51:43,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:51:43,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:51:43,183 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:51:43,206 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:51:43,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:51:43,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:51:43,208 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:51:43,208 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:51:43,208 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:51:43,209 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:51:43,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:51:43,209 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:51:43,209 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:51:43,209 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:51:43,210 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:51:43,212 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:51:43,213 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:51:43,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:51:43,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:51:43,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:51:43,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:51:43,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:51:43,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:51:43,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:51:43,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:51:43,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:51:43,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:51:43,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:51:43,217 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:51:43,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:51:43,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:51:43,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:51:43,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:51:43,219 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:51:43,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:51:43,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:51:43,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:51:43,220 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:51:43,221 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:51:43,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:51:43,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:51:43,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:51:43,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:51:43,311 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:51:43,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label02_true-unreach-call.c [2018-10-25 01:51:43,373 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9663373c1/50454bded06c4cb386519162fc2d4a93/FLAG4ce4507e6 [2018-10-25 01:51:44,077 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:51:44,078 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label02_true-unreach-call.c [2018-10-25 01:51:44,097 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9663373c1/50454bded06c4cb386519162fc2d4a93/FLAG4ce4507e6 [2018-10-25 01:51:44,119 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9663373c1/50454bded06c4cb386519162fc2d4a93 [2018-10-25 01:51:44,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:51:44,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:51:44,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:44,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:51:44,137 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:51:44,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:44" (1/1) ... [2018-10-25 01:51:44,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3993b3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:44, skipping insertion in model container [2018-10-25 01:51:44,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:44" (1/1) ... [2018-10-25 01:51:44,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:51:44,239 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:51:44,934 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:44,938 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:51:45,224 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:45,245 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:51:45,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45 WrapperNode [2018-10-25 01:51:45,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:45,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:45,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:51:45,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:51:45,258 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:51:45" (1/1) ... [2018-10-25 01:51:45,295 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:51:45" (1/1) ... [2018-10-25 01:51:45,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:45,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:51:45,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:51:45,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:51:45,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (1/1) ... [2018-10-25 01:51:45,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (1/1) ... [2018-10-25 01:51:45,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (1/1) ... [2018-10-25 01:51:45,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (1/1) ... [2018-10-25 01:51:45,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (1/1) ... [2018-10-25 01:51:45,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (1/1) ... [2018-10-25 01:51:45,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (1/1) ... [2018-10-25 01:51:45,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:51:45,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:51:45,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:51:45,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:51:45,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (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:51:45,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:51:45,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:51:45,862 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:51:45,863 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:51:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:51:45,863 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:51:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:51:45,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:51:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:51:45,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:51:51,614 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:51:51,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:51:51 BoogieIcfgContainer [2018-10-25 01:51:51,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:51:51,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:51:51,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:51:51,622 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:51:51,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:51:44" (1/3) ... [2018-10-25 01:51:51,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38707927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:51:51, skipping insertion in model container [2018-10-25 01:51:51,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:45" (2/3) ... [2018-10-25 01:51:51,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38707927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:51:51, skipping insertion in model container [2018-10-25 01:51:51,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:51:51" (3/3) ... [2018-10-25 01:51:51,628 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label02_true-unreach-call.c [2018-10-25 01:51:51,639 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:51:51,649 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:51:51,668 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:51:51,711 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:51:51,711 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:51:51,712 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:51:51,712 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:51:51,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:51:51,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:51:51,712 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:51:51,713 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:51:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:51:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-25 01:51:51,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:51:51,765 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, 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:51:51,768 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:51:51,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:51:51,779 INFO L82 PathProgramCache]: Analyzing trace with hash -730804356, now seen corresponding path program 1 times [2018-10-25 01:51:51,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:51:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:51,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:51:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:51,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:51:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:51:52,412 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:51:52,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:51:52,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:51:52,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:51:52,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:51:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:51:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:51:52,442 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:52:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:00,674 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:52:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:52:00,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-10-25 01:52:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:00,702 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:52:00,703 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:52:00,713 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:52:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:52:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2018-10-25 01:52:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-10-25 01:52:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1954 transitions. [2018-10-25 01:52:00,854 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1954 transitions. Word has length 68 [2018-10-25 01:52:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:00,855 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1954 transitions. [2018-10-25 01:52:00,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:52:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1954 transitions. [2018-10-25 01:52:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 01:52:00,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:00,878 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, 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] [2018-10-25 01:52:00,878 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:00,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:00,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1744489539, now seen corresponding path program 1 times [2018-10-25 01:52:00,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:00,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:00,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:00,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:00,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:01,180 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:01,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:01,352 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:01,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:01,355 INFO L87 Difference]: Start difference. First operand 1097 states and 1954 transitions. Second operand 6 states. [2018-10-25 01:52:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:06,929 INFO L93 Difference]: Finished difference Result 3259 states and 5952 transitions. [2018-10-25 01:52:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:06,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-25 01:52:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:06,967 INFO L225 Difference]: With dead ends: 3259 [2018-10-25 01:52:06,967 INFO L226 Difference]: Without dead ends: 2168 [2018-10-25 01:52:06,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-25 01:52:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2142. [2018-10-25 01:52:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-10-25 01:52:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3739 transitions. [2018-10-25 01:52:07,087 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3739 transitions. Word has length 139 [2018-10-25 01:52:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:07,087 INFO L481 AbstractCegarLoop]: Abstraction has 2142 states and 3739 transitions. [2018-10-25 01:52:07,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3739 transitions. [2018-10-25 01:52:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-25 01:52:07,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:07,094 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, 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] [2018-10-25 01:52:07,094 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:07,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash -990959541, now seen corresponding path program 1 times [2018-10-25 01:52:07,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:07,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:07,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:07,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:07,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:07,429 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:07,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:07,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:07,431 INFO L87 Difference]: Start difference. First operand 2142 states and 3739 transitions. Second operand 6 states. [2018-10-25 01:52:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:12,797 INFO L93 Difference]: Finished difference Result 7053 states and 12688 transitions. [2018-10-25 01:52:12,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:12,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-10-25 01:52:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:12,837 INFO L225 Difference]: With dead ends: 7053 [2018-10-25 01:52:12,838 INFO L226 Difference]: Without dead ends: 4917 [2018-10-25 01:52:12,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2018-10-25 01:52:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4877. [2018-10-25 01:52:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2018-10-25 01:52:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7891 transitions. [2018-10-25 01:52:13,023 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 7891 transitions. Word has length 167 [2018-10-25 01:52:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:13,023 INFO L481 AbstractCegarLoop]: Abstraction has 4877 states and 7891 transitions. [2018-10-25 01:52:13,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 7891 transitions. [2018-10-25 01:52:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-25 01:52:13,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:13,031 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, 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] [2018-10-25 01:52:13,031 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:13,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash -964551673, now seen corresponding path program 1 times [2018-10-25 01:52:13,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:13,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:13,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:13,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:13,376 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:13,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:13,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:13,790 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:13,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:13,791 INFO L87 Difference]: Start difference. First operand 4877 states and 7891 transitions. Second operand 6 states. [2018-10-25 01:52:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:17,397 INFO L93 Difference]: Finished difference Result 11909 states and 19972 transitions. [2018-10-25 01:52:17,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:17,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2018-10-25 01:52:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:17,451 INFO L225 Difference]: With dead ends: 11909 [2018-10-25 01:52:17,451 INFO L226 Difference]: Without dead ends: 7038 [2018-10-25 01:52:17,478 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-25 01:52:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2018-10-25 01:52:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 6977. [2018-10-25 01:52:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-10-25 01:52:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 9942 transitions. [2018-10-25 01:52:17,704 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 9942 transitions. Word has length 185 [2018-10-25 01:52:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:17,705 INFO L481 AbstractCegarLoop]: Abstraction has 6977 states and 9942 transitions. [2018-10-25 01:52:17,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 9942 transitions. [2018-10-25 01:52:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-25 01:52:17,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:17,717 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:17,717 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:17,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:17,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1679600594, now seen corresponding path program 1 times [2018-10-25 01:52:17,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:17,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:17,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:17,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:18,048 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:18,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:18,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:18,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:18,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:18,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:18,549 INFO L87 Difference]: Start difference. First operand 6977 states and 9942 transitions. Second operand 6 states. [2018-10-25 01:52:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:22,901 INFO L93 Difference]: Finished difference Result 17709 states and 25496 transitions. [2018-10-25 01:52:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:22,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 232 [2018-10-25 01:52:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:22,949 INFO L225 Difference]: With dead ends: 17709 [2018-10-25 01:52:22,950 INFO L226 Difference]: Without dead ends: 10738 [2018-10-25 01:52:22,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10738 states. [2018-10-25 01:52:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10738 to 10702. [2018-10-25 01:52:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2018-10-25 01:52:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 14504 transitions. [2018-10-25 01:52:23,240 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 14504 transitions. Word has length 232 [2018-10-25 01:52:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:23,241 INFO L481 AbstractCegarLoop]: Abstraction has 10702 states and 14504 transitions. [2018-10-25 01:52:23,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 14504 transitions. [2018-10-25 01:52:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-25 01:52:23,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:23,248 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:23,248 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:23,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1670114349, now seen corresponding path program 1 times [2018-10-25 01:52:23,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:23,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:23,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:23,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:23,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-25 01:52:23,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:23,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:52:23,528 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:23,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:52:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:52:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:52:23,531 INFO L87 Difference]: Start difference. First operand 10702 states and 14504 transitions. Second operand 4 states. [2018-10-25 01:52:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:28,102 INFO L93 Difference]: Finished difference Result 27183 states and 37579 transitions. [2018-10-25 01:52:28,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:52:28,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-10-25 01:52:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:28,191 INFO L225 Difference]: With dead ends: 27183 [2018-10-25 01:52:28,191 INFO L226 Difference]: Without dead ends: 16487 [2018-10-25 01:52:28,239 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:52:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2018-10-25 01:52:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16487. [2018-10-25 01:52:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16487 states. [2018-10-25 01:52:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16487 states to 16487 states and 21165 transitions. [2018-10-25 01:52:28,609 INFO L78 Accepts]: Start accepts. Automaton has 16487 states and 21165 transitions. Word has length 269 [2018-10-25 01:52:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:28,610 INFO L481 AbstractCegarLoop]: Abstraction has 16487 states and 21165 transitions. [2018-10-25 01:52:28,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:52:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16487 states and 21165 transitions. [2018-10-25 01:52:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-25 01:52:28,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:28,664 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:28,665 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1403080672, now seen corresponding path program 1 times [2018-10-25 01:52:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:28,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:28,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:29,426 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-10-25 01:52:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-25 01:52:29,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:52:29,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:52:29,640 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 493 with the following transitions: [2018-10-25 01:52:29,642 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [623], [625], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1128], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:52:29,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:52:29,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:52:32,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:52:32,679 INFO L272 AbstractInterpreter]: Visited 249 different actions 743 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 24 variables. [2018-10-25 01:52:32,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:32,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:52:32,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:52:32,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:52:32,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:32,744 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:52:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:32,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:52:33,767 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-10-25 01:52:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-25 01:52:34,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:52:35,084 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2018-10-25 01:52:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-25 01:52:37,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:52:37,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2018-10-25 01:52:37,735 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:52:37,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 01:52:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 01:52:37,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-25 01:52:37,738 INFO L87 Difference]: Start difference. First operand 16487 states and 21165 transitions. Second operand 9 states. [2018-10-25 01:52:39,586 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-10-25 01:53:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:53:23,835 INFO L93 Difference]: Finished difference Result 42042 states and 53454 transitions. [2018-10-25 01:53:23,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 01:53:23,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 492 [2018-10-25 01:53:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:53:23,968 INFO L225 Difference]: With dead ends: 42042 [2018-10-25 01:53:23,969 INFO L226 Difference]: Without dead ends: 25561 [2018-10-25 01:53:24,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1002 GetRequests, 979 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-10-25 01:53:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25561 states. [2018-10-25 01:53:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25561 to 25496. [2018-10-25 01:53:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25496 states. [2018-10-25 01:53:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25496 states to 25496 states and 31733 transitions. [2018-10-25 01:53:25,053 INFO L78 Accepts]: Start accepts. Automaton has 25496 states and 31733 transitions. Word has length 492 [2018-10-25 01:53:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:53:25,054 INFO L481 AbstractCegarLoop]: Abstraction has 25496 states and 31733 transitions. [2018-10-25 01:53:25,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 01:53:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25496 states and 31733 transitions. [2018-10-25 01:53:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-25 01:53:25,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:53:25,159 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:25,160 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:53:25,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1811401202, now seen corresponding path program 1 times [2018-10-25 01:53:25,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:53:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:53:25,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:53:25,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:53:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:53:26,727 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 01:53:27,226 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-25 01:53:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 387 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:53:29,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:53:29,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:53:29,066 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 535 with the following transitions: [2018-10-25 01:53:29,067 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [623], [625], [628], [636], [644], [652], [660], [668], [673], [676], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1445], [1449], [1452], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:53:29,077 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:53:29,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:53:29,395 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:53:29,396 INFO L272 AbstractInterpreter]: Visited 271 different actions 271 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:53:29,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:53:29,432 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:53:30,393 INFO L232 lantSequenceWeakener]: Weakened 522 states. On average, predicates are now at 77.74% of their original sizes. [2018-10-25 01:53:30,394 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:53:30,676 INFO L413 sIntCurrentIteration]: We have 533 unified AI predicates [2018-10-25 01:53:30,677 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:53:30,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:53:30,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2018-10-25 01:53:30,680 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:53:30,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:53:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:53:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:53:30,682 INFO L87 Difference]: Start difference. First operand 25496 states and 31733 transitions. Second operand 6 states. [2018-10-25 01:53:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:53:50,527 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.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:53:50,533 INFO L168 Benchmark]: Toolchain (without parser) took 126401.68 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:53:50,534 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:53:50,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1113.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:50,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 319.64 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 687.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -795.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:50,536 INFO L168 Benchmark]: Boogie Preprocessor took 215.97 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:50,537 INFO L168 Benchmark]: RCFGBuilder took 5832.31 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:50,538 INFO L168 Benchmark]: TraceAbstraction took 118915.41 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 2.8 GB in the end (delta: -982.9 MB). Peak memory consumption was 801.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:50,546 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1113.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 319.64 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 687.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -795.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 215.97 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5832.31 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118915.41 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.8 GB). Free memory was 1.8 GB in the beginning and 2.8 GB in the end (delta: -982.9 MB). Peak memory consumption was 801.3 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...