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_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:54:20,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:54:20,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:54:20,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:54:20,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:54:20,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:54:20,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:54:20,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:54:20,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:54:20,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:54:20,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:54:20,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:54:20,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:54:20,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:54:20,387 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:54:20,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:54:20,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:54:20,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:54:20,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:54:20,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:54:20,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:54:20,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:54:20,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:54:20,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:54:20,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:54:20,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:54:20,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:54:20,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:54:20,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:54:20,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:54:20,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:54:20,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:54:20,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:54:20,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:54:20,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:54:20,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:54:20,418 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:54:20,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:54:20,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:54:20,443 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:54:20,443 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:54:20,444 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:54:20,444 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:54:20,444 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:54:20,444 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:54:20,445 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:54:20,445 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:54:20,445 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:54:20,445 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:54:20,445 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:54:20,446 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:54:20,446 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:54:20,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:54:20,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:54:20,448 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:54:20,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:54:20,448 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:54:20,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:54:20,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:54:20,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:54:20,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:54:20,450 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:54:20,450 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:54:20,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:54:20,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:54:20,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:54:20,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:54:20,451 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:54:20,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:54:20,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:54:20,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:54:20,452 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:54:20,452 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:54:20,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:54:20,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:54:20,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:54:20,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:54:20,549 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:54:20,550 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label59_true-unreach-call.c [2018-10-25 01:54:20,609 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4ff8b659d/fa0acbddba1749a3b6140936e2b46422/FLAG0a5656658 [2018-10-25 01:54:21,270 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:54:21,272 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label59_true-unreach-call.c [2018-10-25 01:54:21,291 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4ff8b659d/fa0acbddba1749a3b6140936e2b46422/FLAG0a5656658 [2018-10-25 01:54:21,310 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4ff8b659d/fa0acbddba1749a3b6140936e2b46422 [2018-10-25 01:54:21,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:54:21,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:54:21,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:54:21,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:54:21,328 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:54:21,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:54:21" (1/1) ... [2018-10-25 01:54:21,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa98528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:21, skipping insertion in model container [2018-10-25 01:54:21,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:54:21" (1/1) ... [2018-10-25 01:54:21,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:54:21,454 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:54:22,236 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:54:22,240 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:54:22,480 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:54:22,501 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:54:22,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22 WrapperNode [2018-10-25 01:54:22,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:54:22,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:54:22,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:54:22,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:54:22,514 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:54:22" (1/1) ... [2018-10-25 01:54:22,561 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:54:22" (1/1) ... [2018-10-25 01:54:22,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:54:22,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:54:22,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:54:22,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:54:22,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (1/1) ... [2018-10-25 01:54:22,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (1/1) ... [2018-10-25 01:54:22,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (1/1) ... [2018-10-25 01:54:22,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (1/1) ... [2018-10-25 01:54:22,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (1/1) ... [2018-10-25 01:54:22,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (1/1) ... [2018-10-25 01:54:22,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (1/1) ... [2018-10-25 01:54:22,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:54:22,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:54:22,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:54:22,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:54:22,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (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:54:23,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:54:23,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:54:23,059 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:54:23,059 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:54:23,059 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:54:23,060 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:54:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:54:23,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:54:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:54:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:54:29,323 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:54:29,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:54:29 BoogieIcfgContainer [2018-10-25 01:54:29,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:54:29,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:54:29,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:54:29,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:54:29,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:54:21" (1/3) ... [2018-10-25 01:54:29,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f095bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:54:29, skipping insertion in model container [2018-10-25 01:54:29,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:54:22" (2/3) ... [2018-10-25 01:54:29,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f095bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:54:29, skipping insertion in model container [2018-10-25 01:54:29,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:54:29" (3/3) ... [2018-10-25 01:54:29,333 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label59_true-unreach-call.c [2018-10-25 01:54:29,341 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:54:29,350 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:54:29,367 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:54:29,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:54:29,409 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:54:29,410 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:54:29,410 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:54:29,410 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:54:29,410 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:54:29,410 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:54:29,411 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:54:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:54:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-25 01:54:29,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:29,454 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] [2018-10-25 01:54:29,457 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:29,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash 371317715, now seen corresponding path program 1 times [2018-10-25 01:54:29,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:29,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:29,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:29,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:30,044 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:54:30,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:30,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:54:30,050 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:30,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:54:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:54:30,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:54:30,101 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:54:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:36,061 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:54:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:54:36,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-25 01:54:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:36,095 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:54:36,095 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:54:36,104 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:54:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:54:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-10-25 01:54:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:54:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1357 transitions. [2018-10-25 01:54:36,212 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1357 transitions. Word has length 51 [2018-10-25 01:54:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:36,213 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1357 transitions. [2018-10-25 01:54:36,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:54:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1357 transitions. [2018-10-25 01:54:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 01:54:36,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:36,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:36,222 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:36,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1405398300, now seen corresponding path program 1 times [2018-10-25 01:54:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:36,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:36,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:36,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:36,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:54:36,666 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:36,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:54:36,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:54:36,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:54:36,669 INFO L87 Difference]: Start difference. First operand 744 states and 1357 transitions. Second operand 5 states. [2018-10-25 01:54:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:41,630 INFO L93 Difference]: Finished difference Result 2196 states and 4092 transitions. [2018-10-25 01:54:41,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:41,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-25 01:54:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:41,649 INFO L225 Difference]: With dead ends: 2196 [2018-10-25 01:54:41,650 INFO L226 Difference]: Without dead ends: 1458 [2018-10-25 01:54:41,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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:54:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-25 01:54:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-10-25 01:54:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-25 01:54:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2551 transitions. [2018-10-25 01:54:41,755 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2551 transitions. Word has length 121 [2018-10-25 01:54:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:41,755 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 2551 transitions. [2018-10-25 01:54:41,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:54:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2551 transitions. [2018-10-25 01:54:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-25 01:54:41,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:41,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:41,770 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:41,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1847072879, now seen corresponding path program 1 times [2018-10-25 01:54:41,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:41,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:41,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:41,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:42,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:42,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:42,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:42,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:42,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:42,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:42,283 INFO L87 Difference]: Start difference. First operand 1438 states and 2551 transitions. Second operand 6 states. [2018-10-25 01:54:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:48,007 INFO L93 Difference]: Finished difference Result 4237 states and 7540 transitions. [2018-10-25 01:54:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:48,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-10-25 01:54:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:48,029 INFO L225 Difference]: With dead ends: 4237 [2018-10-25 01:54:48,030 INFO L226 Difference]: Without dead ends: 2805 [2018-10-25 01:54:48,040 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:54:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2018-10-25 01:54:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2785. [2018-10-25 01:54:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2018-10-25 01:54:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4352 transitions. [2018-10-25 01:54:48,130 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4352 transitions. Word has length 124 [2018-10-25 01:54:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:48,131 INFO L481 AbstractCegarLoop]: Abstraction has 2785 states and 4352 transitions. [2018-10-25 01:54:48,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4352 transitions. [2018-10-25 01:54:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-25 01:54:48,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:48,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:48,137 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:48,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash -674317012, now seen corresponding path program 1 times [2018-10-25 01:54:48,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:48,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:48,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:48,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:48,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:48,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:48,346 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:48,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:48,348 INFO L87 Difference]: Start difference. First operand 2785 states and 4352 transitions. Second operand 6 states. [2018-10-25 01:54:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:52,908 INFO L93 Difference]: Finished difference Result 6952 states and 11048 transitions. [2018-10-25 01:54:52,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:52,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-25 01:54:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:52,943 INFO L225 Difference]: With dead ends: 6952 [2018-10-25 01:54:52,944 INFO L226 Difference]: Without dead ends: 4173 [2018-10-25 01:54:52,960 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:54:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-10-25 01:54:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4153. [2018-10-25 01:54:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2018-10-25 01:54:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 5896 transitions. [2018-10-25 01:54:53,070 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 5896 transitions. Word has length 125 [2018-10-25 01:54:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:53,071 INFO L481 AbstractCegarLoop]: Abstraction has 4153 states and 5896 transitions. [2018-10-25 01:54:53,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 5896 transitions. [2018-10-25 01:54:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-25 01:54:53,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:53,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:53,073 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:53,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -710224295, now seen corresponding path program 1 times [2018-10-25 01:54:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:53,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:53,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:53,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:53,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:53,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:53,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:53,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:53,229 INFO L87 Difference]: Start difference. First operand 4153 states and 5896 transitions. Second operand 6 states. [2018-10-25 01:54:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:57,973 INFO L93 Difference]: Finished difference Result 11374 states and 16767 transitions. [2018-10-25 01:54:57,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:57,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-10-25 01:54:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:58,015 INFO L225 Difference]: With dead ends: 11374 [2018-10-25 01:54:58,016 INFO L226 Difference]: Without dead ends: 7227 [2018-10-25 01:54:58,049 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:54:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2018-10-25 01:54:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7152. [2018-10-25 01:54:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7152 states. [2018-10-25 01:54:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 9826 transitions. [2018-10-25 01:54:58,249 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 9826 transitions. Word has length 128 [2018-10-25 01:54:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:58,250 INFO L481 AbstractCegarLoop]: Abstraction has 7152 states and 9826 transitions. [2018-10-25 01:54:58,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 9826 transitions. [2018-10-25 01:54:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 01:54:58,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:58,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:58,253 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:58,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash -727624727, now seen corresponding path program 1 times [2018-10-25 01:54:58,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:58,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:58,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:58,518 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:54:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:58,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:58,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:58,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:58,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:58,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:58,834 INFO L87 Difference]: Start difference. First operand 7152 states and 9826 transitions. Second operand 6 states. [2018-10-25 01:55:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:02,487 INFO L93 Difference]: Finished difference Result 17771 states and 25546 transitions. [2018-10-25 01:55:02,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:55:02,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-25 01:55:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:02,551 INFO L225 Difference]: With dead ends: 17771 [2018-10-25 01:55:02,552 INFO L226 Difference]: Without dead ends: 10625 [2018-10-25 01:55:02,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:55:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10625 states. [2018-10-25 01:55:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10625 to 10585. [2018-10-25 01:55:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2018-10-25 01:55:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 13819 transitions. [2018-10-25 01:55:02,935 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 13819 transitions. Word has length 136 [2018-10-25 01:55:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:02,935 INFO L481 AbstractCegarLoop]: Abstraction has 10585 states and 13819 transitions. [2018-10-25 01:55:02,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:55:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 13819 transitions. [2018-10-25 01:55:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 01:55:02,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:02,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:02,940 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:02,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2054227824, now seen corresponding path program 1 times [2018-10-25 01:55:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:02,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:02,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:02,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:02,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:03,210 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-25 01:55:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:03,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:55:03,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:55:03,344 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-10-25 01:55:03,346 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], [487], [489], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [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], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:55:03,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:55:03,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:55:04,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:55:04,378 INFO L272 AbstractInterpreter]: Visited 100 different actions 286 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-25 01:55:04,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:04,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:55:04,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:55:04,426 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:55:04,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:04,440 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:55:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:04,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:55:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:04,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:55:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:05,025 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:55:05,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-10-25 01:55:05,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:05,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:55:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:55:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:55:05,027 INFO L87 Difference]: Start difference. First operand 10585 states and 13819 transitions. Second operand 3 states. [2018-10-25 01:55:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:09,090 INFO L93 Difference]: Finished difference Result 21164 states and 27640 transitions. [2018-10-25 01:55:09,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:55:09,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-10-25 01:55:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:09,126 INFO L225 Difference]: With dead ends: 21164 [2018-10-25 01:55:09,126 INFO L226 Difference]: Without dead ends: 7903 [2018-10-25 01:55:09,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:55:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2018-10-25 01:55:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 7903. [2018-10-25 01:55:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7903 states. [2018-10-25 01:55:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7903 states to 7903 states and 8996 transitions. [2018-10-25 01:55:09,403 INFO L78 Accepts]: Start accepts. Automaton has 7903 states and 8996 transitions. Word has length 143 [2018-10-25 01:55:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:09,403 INFO L481 AbstractCegarLoop]: Abstraction has 7903 states and 8996 transitions. [2018-10-25 01:55:09,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:55:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7903 states and 8996 transitions. [2018-10-25 01:55:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-25 01:55:09,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:09,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:09,409 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:09,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1721939931, now seen corresponding path program 1 times [2018-10-25 01:55:09,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:09,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:09,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:09,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:09,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:09,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:09,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:55:09,670 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:09,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:55:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:55:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:09,672 INFO L87 Difference]: Start difference. First operand 7903 states and 8996 transitions. Second operand 4 states. [2018-10-25 01:55:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:12,528 INFO L93 Difference]: Finished difference Result 23776 states and 27470 transitions. [2018-10-25 01:55:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:55:12,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-10-25 01:55:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:12,585 INFO L225 Difference]: With dead ends: 23776 [2018-10-25 01:55:12,586 INFO L226 Difference]: Without dead ends: 15879 [2018-10-25 01:55:12,622 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:55:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2018-10-25 01:55:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2018-10-25 01:55:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15877 states. [2018-10-25 01:55:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 17767 transitions. [2018-10-25 01:55:13,158 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 17767 transitions. Word has length 214 [2018-10-25 01:55:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:13,159 INFO L481 AbstractCegarLoop]: Abstraction has 15877 states and 17767 transitions. [2018-10-25 01:55:13,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:55:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 17767 transitions. [2018-10-25 01:55:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-25 01:55:13,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:13,227 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2018-10-25 01:55:13,227 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:13,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1257154816, now seen corresponding path program 1 times [2018-10-25 01:55:13,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:13,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:13,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 300 proven. 223 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-10-25 01:55:14,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:55:14,382 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:55:14,383 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 675 with the following transitions: [2018-10-25 01:55:14,384 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], [487], [489], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [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], [836], [837], [841], [845], [849], [853], [856], [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], [1453], [1456], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:55:14,402 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:55:14,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:55:14,772 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:55:14,772 INFO L272 AbstractInterpreter]: Visited 273 different actions 273 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:55:14,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:14,802 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:55:16,183 INFO L232 lantSequenceWeakener]: Weakened 659 states. On average, predicates are now at 77.54% of their original sizes. [2018-10-25 01:55:16,184 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:55:16,473 INFO L413 sIntCurrentIteration]: We have 673 unified AI predicates [2018-10-25 01:55:16,473 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:55:16,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:55:16,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:55:16,475 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:16,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:55:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:55:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:55:16,476 INFO L87 Difference]: Start difference. First operand 15877 states and 17767 transitions. Second operand 6 states. [2018-10-25 01:55:27,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:55:27,603 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:55:27,614 INFO L168 Benchmark]: Toolchain (without parser) took 66292.38 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -302.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:55:27,616 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:55:27,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1178.79 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:27,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 303.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:27,624 INFO L168 Benchmark]: Boogie Preprocessor took 182.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:27,633 INFO L168 Benchmark]: RCFGBuilder took 6335.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.0 MB). Peak memory consumption was 270.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:27,634 INFO L168 Benchmark]: TraceAbstraction took 58287.84 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 777.5 MB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 205.5 MB). Peak memory consumption was 983.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:55:27,643 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1178.79 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 303.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6335.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 270.0 MB). Peak memory consumption was 270.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58287.84 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 777.5 MB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 205.5 MB). Peak memory consumption was 983.0 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...