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/Problem15_label08_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:47:40,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:47:40,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:47:40,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:47:40,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:47:40,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:47:40,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:47:40,288 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:47:40,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:47:40,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:47:40,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:47:40,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:47:40,302 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:47:40,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:47:40,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:47:40,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:47:40,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:47:40,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:47:40,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:47:40,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:47:40,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:47:40,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:47:40,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:47:40,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:47:40,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:47:40,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:47:40,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:47:40,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:47:40,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:47:40,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:47:40,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:47:40,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:47:40,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:47:40,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:47:40,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:47:40,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:47:40,332 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:47:40,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:47:40,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:47:40,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:47:40,363 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:47:40,363 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:47:40,363 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:47:40,363 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:47:40,363 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:47:40,364 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:47:40,364 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:47:40,364 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:47:40,365 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:47:40,365 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:47:40,365 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:47:40,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:47:40,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:47:40,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:47:40,366 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:47:40,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:47:40,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:47:40,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:47:40,367 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:47:40,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:47:40,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:47:40,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:47:40,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:47:40,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:47:40,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:47:40,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:47:40,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:47:40,369 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:47:40,369 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:47:40,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:47:40,369 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:47:40,369 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:47:40,370 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:47:40,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:47:40,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:47:40,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:47:40,466 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:47:40,467 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:47:40,468 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label08_true-unreach-call.c [2018-10-25 01:47:40,545 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8cfe979b0/ca7222c714a04b47be820ad013ca170c/FLAGd5f2296a6 [2018-10-25 01:47:41,302 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:47:41,303 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label08_true-unreach-call.c [2018-10-25 01:47:41,324 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8cfe979b0/ca7222c714a04b47be820ad013ca170c/FLAGd5f2296a6 [2018-10-25 01:47:41,346 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8cfe979b0/ca7222c714a04b47be820ad013ca170c [2018-10-25 01:47:41,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:47:41,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:47:41,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:47:41,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:47:41,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:47:41,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:47:41" (1/1) ... [2018-10-25 01:47:41,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48886557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:41, skipping insertion in model container [2018-10-25 01:47:41,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:47:41" (1/1) ... [2018-10-25 01:47:41,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:47:41,464 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:47:42,291 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:47:42,296 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:47:42,589 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:47:42,613 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:47:42,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42 WrapperNode [2018-10-25 01:47:42,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:47:42,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:47:42,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:47:42,615 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:47:42,626 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:47:42" (1/1) ... [2018-10-25 01:47:42,678 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:47:42" (1/1) ... [2018-10-25 01:47:43,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:47:43,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:47:43,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:47:43,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:47:43,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (1/1) ... [2018-10-25 01:47:43,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (1/1) ... [2018-10-25 01:47:43,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (1/1) ... [2018-10-25 01:47:43,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (1/1) ... [2018-10-25 01:47:43,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (1/1) ... [2018-10-25 01:47:43,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (1/1) ... [2018-10-25 01:47:43,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (1/1) ... [2018-10-25 01:47:43,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:47:43,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:47:43,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:47:43,257 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:47:43,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (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:47:43,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:47:43,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:47:43,334 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:47:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:47:43,334 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:47:43,334 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:47:43,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:47:43,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:47:43,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:47:43,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:47:50,709 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:47:50,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:47:50 BoogieIcfgContainer [2018-10-25 01:47:50,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:47:50,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:47:50,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:47:50,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:47:50,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:47:41" (1/3) ... [2018-10-25 01:47:50,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ace37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:47:50, skipping insertion in model container [2018-10-25 01:47:50,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:42" (2/3) ... [2018-10-25 01:47:50,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ace37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:47:50, skipping insertion in model container [2018-10-25 01:47:50,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:47:50" (3/3) ... [2018-10-25 01:47:50,719 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label08_true-unreach-call.c [2018-10-25 01:47:50,729 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:47:50,739 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:47:50,757 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:47:50,799 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:47:50,799 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:47:50,799 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:47:50,799 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:47:50,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:47:50,800 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:47:50,800 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:47:50,800 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:47:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-25 01:47:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-25 01:47:50,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:50,844 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] [2018-10-25 01:47:50,847 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:50,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash -561435596, now seen corresponding path program 1 times [2018-10-25 01:47:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:50,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:50,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:50,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:50,907 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:51,438 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:47:51,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:51,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:47:51,441 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:51,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:47:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:47:51,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:47:51,468 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-10-25 01:47:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:47:56,285 INFO L93 Difference]: Finished difference Result 1194 states and 2152 transitions. [2018-10-25 01:47:56,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:47:56,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-25 01:47:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:47:56,319 INFO L225 Difference]: With dead ends: 1194 [2018-10-25 01:47:56,319 INFO L226 Difference]: Without dead ends: 754 [2018-10-25 01:47:56,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:47:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-25 01:47:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-10-25 01:47:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-25 01:47:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1325 transitions. [2018-10-25 01:47:56,430 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1325 transitions. Word has length 58 [2018-10-25 01:47:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:47:56,431 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1325 transitions. [2018-10-25 01:47:56,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:47:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1325 transitions. [2018-10-25 01:47:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 01:47:56,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:56,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,440 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:56,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1198310345, now seen corresponding path program 1 times [2018-10-25 01:47:56,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:56,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:56,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:47:56,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:56,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:47:56,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:56,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:47:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:47:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:47:56,737 INFO L87 Difference]: Start difference. First operand 752 states and 1325 transitions. Second operand 6 states. [2018-10-25 01:48:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:11,912 INFO L93 Difference]: Finished difference Result 2839 states and 5159 transitions. [2018-10-25 01:48:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:48:11,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-25 01:48:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:11,933 INFO L225 Difference]: With dead ends: 2839 [2018-10-25 01:48:11,934 INFO L226 Difference]: Without dead ends: 2093 [2018-10-25 01:48:11,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:48:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-25 01:48:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2055. [2018-10-25 01:48:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-10-25 01:48:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3404 transitions. [2018-10-25 01:48:12,060 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3404 transitions. Word has length 132 [2018-10-25 01:48:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:12,060 INFO L481 AbstractCegarLoop]: Abstraction has 2055 states and 3404 transitions. [2018-10-25 01:48:12,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:48:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3404 transitions. [2018-10-25 01:48:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-25 01:48:12,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:12,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,077 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:12,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1211406466, now seen corresponding path program 1 times [2018-10-25 01:48:12,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:12,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:12,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:12,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:12,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:48:12,433 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:12,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:48:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:48:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:48:12,435 INFO L87 Difference]: Start difference. First operand 2055 states and 3404 transitions. Second operand 5 states. [2018-10-25 01:48:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:20,023 INFO L93 Difference]: Finished difference Result 6122 states and 10301 transitions. [2018-10-25 01:48:20,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:48:20,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-10-25 01:48:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:20,049 INFO L225 Difference]: With dead ends: 6122 [2018-10-25 01:48:20,049 INFO L226 Difference]: Without dead ends: 4073 [2018-10-25 01:48:20,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:48:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2018-10-25 01:48:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3996. [2018-10-25 01:48:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3996 states. [2018-10-25 01:48:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 5874 transitions. [2018-10-25 01:48:20,179 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 5874 transitions. Word has length 135 [2018-10-25 01:48:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:20,180 INFO L481 AbstractCegarLoop]: Abstraction has 3996 states and 5874 transitions. [2018-10-25 01:48:20,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:48:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 5874 transitions. [2018-10-25 01:48:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-25 01:48:20,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:20,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,184 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:20,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1183440816, now seen corresponding path program 1 times [2018-10-25 01:48:20,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:20,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:20,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:20,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:20,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:48:20,355 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:20,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:48:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:48:20,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:48:20,357 INFO L87 Difference]: Start difference. First operand 3996 states and 5874 transitions. Second operand 6 states. [2018-10-25 01:48:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:27,045 INFO L93 Difference]: Finished difference Result 11083 states and 16941 transitions. [2018-10-25 01:48:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:48:27,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-25 01:48:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:27,088 INFO L225 Difference]: With dead ends: 11083 [2018-10-25 01:48:27,089 INFO L226 Difference]: Without dead ends: 7093 [2018-10-25 01:48:27,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:48:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7093 states. [2018-10-25 01:48:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7093 to 6984. [2018-10-25 01:48:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6984 states. [2018-10-25 01:48:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6984 states to 6984 states and 9527 transitions. [2018-10-25 01:48:27,323 INFO L78 Accepts]: Start accepts. Automaton has 6984 states and 9527 transitions. Word has length 145 [2018-10-25 01:48:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:27,324 INFO L481 AbstractCegarLoop]: Abstraction has 6984 states and 9527 transitions. [2018-10-25 01:48:27,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:48:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6984 states and 9527 transitions. [2018-10-25 01:48:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 01:48:27,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:27,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,330 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:27,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:27,331 INFO L82 PathProgramCache]: Analyzing trace with hash 984930483, now seen corresponding path program 1 times [2018-10-25 01:48:27,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:27,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:27,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:27,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:27,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:27,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:27,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:48:27,717 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:27,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:48:27,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:48:27,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:48:27,718 INFO L87 Difference]: Start difference. First operand 6984 states and 9527 transitions. Second operand 5 states. [2018-10-25 01:48:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:40,969 INFO L93 Difference]: Finished difference Result 18666 states and 26327 transitions. [2018-10-25 01:48:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:48:40,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-10-25 01:48:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:41,041 INFO L225 Difference]: With dead ends: 18666 [2018-10-25 01:48:41,041 INFO L226 Difference]: Without dead ends: 11688 [2018-10-25 01:48:41,073 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-25 01:48:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11688 states. [2018-10-25 01:48:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11688 to 11527. [2018-10-25 01:48:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11527 states. [2018-10-25 01:48:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11527 states to 11527 states and 15503 transitions. [2018-10-25 01:48:41,347 INFO L78 Accepts]: Start accepts. Automaton has 11527 states and 15503 transitions. Word has length 155 [2018-10-25 01:48:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:41,348 INFO L481 AbstractCegarLoop]: Abstraction has 11527 states and 15503 transitions. [2018-10-25 01:48:41,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:48:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 11527 states and 15503 transitions. [2018-10-25 01:48:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 01:48:41,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:41,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:41,353 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:41,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash 528602966, now seen corresponding path program 1 times [2018-10-25 01:48:41,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:41,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:41,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:41,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:41,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:41,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:48:41,843 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:48:41,844 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-10-25 01:48:41,846 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-25 01:48:41,903 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:48:41,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:48:42,400 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:48:42,402 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:48:42,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:42,433 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:48:42,856 INFO L232 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 78.37% of their original sizes. [2018-10-25 01:48:42,856 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:48:42,996 INFO L413 sIntCurrentIteration]: We have 169 unified AI predicates [2018-10-25 01:48:42,996 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:48:42,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:48:42,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-25 01:48:42,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:42,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:48:42,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:48:42,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:48:42,999 INFO L87 Difference]: Start difference. First operand 11527 states and 15503 transitions. Second operand 6 states. [2018-10-25 01:49:23,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:49:23,571 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:49:23,576 INFO L168 Benchmark]: Toolchain (without parser) took 102219.44 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 545.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:49:23,578 INFO L168 Benchmark]: CDTParser took 0.22 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:49:23,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1255.34 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:49:23,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 388.88 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -823.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:49:23,581 INFO L168 Benchmark]: Boogie Preprocessor took 252.83 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:49:23,581 INFO L168 Benchmark]: RCFGBuilder took 7453.46 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: 292.2 MB). Peak memory consumption was 292.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:49:23,582 INFO L168 Benchmark]: TraceAbstraction took 92864.01 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 3.4 GB in the end (delta: -1.6 GB). Peak memory consumption was 236.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:49:23,588 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.22 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 1255.34 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 388.88 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -823.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 252.83 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7453.46 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: 292.2 MB). Peak memory consumption was 292.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92864.01 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 3.4 GB in the end (delta: -1.6 GB). Peak memory consumption was 236.4 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...