/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:25,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:25,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:25,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:25,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:25,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:25,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:25,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:25,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:25,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:25,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:25,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:25,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:25,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:25,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:25,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:25,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:25,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:25,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:25,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:25,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:25,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:25,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:25,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:25,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:25,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:25,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:25,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:25,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:25,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:25,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:25,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:25,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:25,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:25,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:25,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:25,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:25,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:25,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:25,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:25,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:25,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:32:25,522 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:25,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:25,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:25,523 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:25,524 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:25,524 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:25,524 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:25,524 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:25,525 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:25,525 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:25,525 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:25,525 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:25,525 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:25,526 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:25,526 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:25,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:25,527 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:25,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:25,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:25,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:25,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:25,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:25,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:25,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:25,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:25,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:25,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:25,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:25,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:25,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:25,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:25,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:25,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:25,531 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:25,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:25,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:25,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:25,532 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:25,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:25,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:25,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:25,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:25,814 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:25,815 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20.c [2019-11-23 23:32:25,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f54cb4ac/1cd26900b5864453904d84e6186223e1/FLAGfdd18a603 [2019-11-23 23:32:26,431 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:26,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label20.c [2019-11-23 23:32:26,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f54cb4ac/1cd26900b5864453904d84e6186223e1/FLAGfdd18a603 [2019-11-23 23:32:26,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f54cb4ac/1cd26900b5864453904d84e6186223e1 [2019-11-23 23:32:26,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:26,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:26,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:26,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:26,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:26,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:26" (1/1) ... [2019-11-23 23:32:26,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6008a3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:26, skipping insertion in model container [2019-11-23 23:32:26,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:26" (1/1) ... [2019-11-23 23:32:26,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:26,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:27,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:27,318 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:27,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:27,433 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:27,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27 WrapperNode [2019-11-23 23:32:27,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:27,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:27,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:27,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:27,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:27,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:27,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:27,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:27,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... [2019-11-23 23:32:27,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:27,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:27,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:27,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:27,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-11-23 23:32:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:27,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:29,577 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:29,577 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:29,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:29 BoogieIcfgContainer [2019-11-23 23:32:29,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:29,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:29,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:29,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:29,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:26" (1/3) ... [2019-11-23 23:32:29,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b76ab43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:29, skipping insertion in model container [2019-11-23 23:32:29,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:27" (2/3) ... [2019-11-23 23:32:29,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b76ab43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:29, skipping insertion in model container [2019-11-23 23:32:29,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:29" (3/3) ... [2019-11-23 23:32:29,586 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label20.c [2019-11-23 23:32:29,596 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:29,603 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:29,614 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:29,639 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:29,640 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:29,640 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:29,640 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:29,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:29,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:29,641 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:29,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:29,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:29,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:29,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:29,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:29,675 INFO L82 PathProgramCache]: Analyzing trace with hash 925947273, now seen corresponding path program 1 times [2019-11-23 23:32:29,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:29,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811463252] [2019-11-23 23:32:29,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:30,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811463252] [2019-11-23 23:32:30,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:30,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:30,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361453935] [2019-11-23 23:32:30,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:30,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:30,070 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:30,921 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:30,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:30,938 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:30,938 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:30,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-23 23:32:31,001 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-23 23:32:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:31,002 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-23 23:32:31,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-23 23:32:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:32:31,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:31,008 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:32:31,008 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash 221747752, now seen corresponding path program 1 times [2019-11-23 23:32:31,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:31,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243889689] [2019-11-23 23:32:31,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:31,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243889689] [2019-11-23 23:32:31,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:31,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:31,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752534854] [2019-11-23 23:32:31,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:31,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:31,133 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-23 23:32:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:31,708 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-23 23:32:31,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:31,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:32:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:31,714 INFO L225 Difference]: With dead ends: 807 [2019-11-23 23:32:31,714 INFO L226 Difference]: Without dead ends: 565 [2019-11-23 23:32:31,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-23 23:32:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-23 23:32:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-23 23:32:31,754 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-23 23:32:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:31,755 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-23 23:32:31,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-23 23:32:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:31,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:31,766 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 23:32:31,766 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:31,766 INFO L82 PathProgramCache]: Analyzing trace with hash -875197475, now seen corresponding path program 1 times [2019-11-23 23:32:31,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:31,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438506228] [2019-11-23 23:32:31,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:31,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438506228] [2019-11-23 23:32:31,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:31,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:31,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283073047] [2019-11-23 23:32:31,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:31,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:31,896 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-23 23:32:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:32,776 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-23 23:32:32,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:32,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 23:32:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:32,787 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 23:32:32,787 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:32,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:32,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-23 23:32:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:32:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1446 transitions. [2019-11-23 23:32:32,854 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1446 transitions. Word has length 102 [2019-11-23 23:32:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:32,855 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1446 transitions. [2019-11-23 23:32:32,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1446 transitions. [2019-11-23 23:32:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:32,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:32,862 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:32:32,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:32,863 INFO L82 PathProgramCache]: Analyzing trace with hash 11612978, now seen corresponding path program 1 times [2019-11-23 23:32:32,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:32,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661848704] [2019-11-23 23:32:32,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:32,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661848704] [2019-11-23 23:32:32,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:32,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:32,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293845898] [2019-11-23 23:32:32,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:32,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:32,944 INFO L87 Difference]: Start difference. First operand 883 states and 1446 transitions. Second operand 3 states. [2019-11-23 23:32:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:33,319 INFO L93 Difference]: Finished difference Result 2165 states and 3502 transitions. [2019-11-23 23:32:33,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:33,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 23:32:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:33,326 INFO L225 Difference]: With dead ends: 2165 [2019-11-23 23:32:33,326 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:33,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1842 transitions. [2019-11-23 23:32:33,361 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1842 transitions. Word has length 102 [2019-11-23 23:32:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:33,361 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1842 transitions. [2019-11-23 23:32:33,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1842 transitions. [2019-11-23 23:32:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:32:33,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:33,365 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:33,365 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2118177909, now seen corresponding path program 1 times [2019-11-23 23:32:33,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:33,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831414090] [2019-11-23 23:32:33,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:33,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831414090] [2019-11-23 23:32:33,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:33,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:33,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412294425] [2019-11-23 23:32:33,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:33,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:33,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:33,450 INFO L87 Difference]: Start difference. First operand 1283 states and 1842 transitions. Second operand 3 states. [2019-11-23 23:32:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:33,935 INFO L93 Difference]: Finished difference Result 3045 states and 4319 transitions. [2019-11-23 23:32:33,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:33,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-23 23:32:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:33,945 INFO L225 Difference]: With dead ends: 3045 [2019-11-23 23:32:33,945 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:32:33,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:32:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1123. [2019-11-23 23:32:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1463 transitions. [2019-11-23 23:32:33,980 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1463 transitions. Word has length 107 [2019-11-23 23:32:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:33,981 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1463 transitions. [2019-11-23 23:32:33,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1463 transitions. [2019-11-23 23:32:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:32:33,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:33,985 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 23:32:33,985 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1735821169, now seen corresponding path program 1 times [2019-11-23 23:32:33,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:33,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749219710] [2019-11-23 23:32:33,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:34,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749219710] [2019-11-23 23:32:34,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:34,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:34,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109010178] [2019-11-23 23:32:34,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:34,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:34,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:34,112 INFO L87 Difference]: Start difference. First operand 1123 states and 1463 transitions. Second operand 4 states. [2019-11-23 23:32:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:34,730 INFO L93 Difference]: Finished difference Result 2725 states and 3556 transitions. [2019-11-23 23:32:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:34,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:32:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:34,737 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:34,737 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:34,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 963. [2019-11-23 23:32:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1224 transitions. [2019-11-23 23:32:34,764 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1224 transitions. Word has length 118 [2019-11-23 23:32:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:34,765 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1224 transitions. [2019-11-23 23:32:34,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1224 transitions. [2019-11-23 23:32:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:32:34,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:34,768 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 23:32:34,769 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1692476685, now seen corresponding path program 1 times [2019-11-23 23:32:34,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:34,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154143128] [2019-11-23 23:32:34,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:34,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154143128] [2019-11-23 23:32:34,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:34,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:34,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771182916] [2019-11-23 23:32:34,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:34,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:34,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:34,858 INFO L87 Difference]: Start difference. First operand 963 states and 1224 transitions. Second operand 3 states. [2019-11-23 23:32:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:35,160 INFO L93 Difference]: Finished difference Result 2005 states and 2525 transitions. [2019-11-23 23:32:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:35,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 23:32:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:35,166 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:35,166 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:35,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-23 23:32:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1236 transitions. [2019-11-23 23:32:35,190 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1236 transitions. Word has length 131 [2019-11-23 23:32:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:35,190 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1236 transitions. [2019-11-23 23:32:35,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1236 transitions. [2019-11-23 23:32:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-23 23:32:35,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:35,195 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:35,195 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 41693313, now seen corresponding path program 1 times [2019-11-23 23:32:35,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:35,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233146874] [2019-11-23 23:32:35,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-23 23:32:35,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233146874] [2019-11-23 23:32:35,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020895467] [2019-11-23 23:32:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:35,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:35,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 23:32:35,604 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 23:32:35,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:35,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-11-23 23:32:35,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030239809] [2019-11-23 23:32:35,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:35,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:32:35,673 INFO L87 Difference]: Start difference. First operand 1043 states and 1236 transitions. Second operand 3 states. [2019-11-23 23:32:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:36,063 INFO L93 Difference]: Finished difference Result 2483 states and 2960 transitions. [2019-11-23 23:32:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:36,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-23 23:32:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:36,065 INFO L225 Difference]: With dead ends: 2483 [2019-11-23 23:32:36,065 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:36,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:32:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:36,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-11-23 23:32:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:36,071 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:36,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:36,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:36,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:36,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:36,588 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-23 23:32:36,865 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-23 23:32:36,869 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:36,869 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:36,869 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:36,869 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:36,869 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:36,869 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:36,870 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:36,872 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:36,873 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:36,873 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:36,873 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:36,873 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:36,873 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:36,873 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:36,873 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:36,874 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:36,874 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:36,874 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:36,874 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:36,874 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:36,874 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:36,874 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:36,875 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:36,875 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:36,875 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:36,875 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:36,875 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:36,875 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:36,875 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:36,876 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:36,876 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:36,876 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:36,876 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:36,876 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:36,876 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:36,876 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:36,877 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 469) no Hoare annotation was computed. [2019-11-23 23:32:36,877 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:36,877 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:36,877 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:36,877 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:36,879 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse7 (not .cse1)) (.cse0 (= ~a19~0 1)) (.cse5 (= ~a11~0 1))) (let ((.cse3 (or (and .cse0 .cse5 .cse9) (and .cse7 .cse5 .cse9) (and .cse7 .cse0 .cse5))) (.cse8 (= ~a17~0 8)) (.cse4 (= ~a28~0 9)) (.cse6 (<= ~a19~0 0)) (.cse2 (<= 8 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse3 .cse2) (and .cse6 .cse7 .cse8) (and .cse6 .cse3) (and .cse8 .cse9) (and .cse4 .cse6) (and .cse0 .cse9 .cse2))))) [2019-11-23 23:32:36,881 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:36,881 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:36,882 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:36,882 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:36,882 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:36,882 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:36,882 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-23 23:32:36,882 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:36,882 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:36,890 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:36,890 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:36,890 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:36,890 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:36,891 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse7 (not .cse1)) (.cse0 (= ~a19~0 1)) (.cse5 (= ~a11~0 1))) (let ((.cse3 (or (and .cse0 .cse5 .cse9) (and .cse7 .cse5 .cse9) (and .cse7 .cse0 .cse5))) (.cse8 (= ~a17~0 8)) (.cse4 (= ~a28~0 9)) (.cse6 (<= ~a19~0 0)) (.cse2 (<= 8 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse3 .cse2) (and .cse6 .cse7 .cse8) (and .cse6 .cse3) (and .cse8 .cse9) (and .cse4 .cse6) (and .cse0 .cse9 .cse2))))) [2019-11-23 23:32:36,891 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:36,891 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:36,891 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:36,891 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:36,891 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:36,891 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:36,892 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:36,895 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:36,895 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:36,895 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:36,895 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:36,895 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:36,895 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:36,896 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:36,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:36 BoogieIcfgContainer [2019-11-23 23:32:36,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:36,944 INFO L168 Benchmark]: Toolchain (without parser) took 10187.94 ms. Allocated memory was 139.5 MB in the beginning and 378.5 MB in the end (delta: 239.1 MB). Free memory was 102.8 MB in the beginning and 307.2 MB in the end (delta: -204.4 MB). Peak memory consumption was 256.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:36,945 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:36,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.74 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 165.3 MB in the end (delta: -62.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:36,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.58 ms. Allocated memory is still 203.9 MB. Free memory was 165.3 MB in the beginning and 159.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:36,951 INFO L168 Benchmark]: Boogie Preprocessor took 116.12 ms. Allocated memory is still 203.9 MB. Free memory was 159.8 MB in the beginning and 155.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:36,952 INFO L168 Benchmark]: RCFGBuilder took 1924.57 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 155.1 MB in the beginning and 178.7 MB in the end (delta: -23.6 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:36,955 INFO L168 Benchmark]: TraceAbstraction took 7361.14 ms. Allocated memory was 245.9 MB in the beginning and 378.5 MB in the end (delta: 132.6 MB). Free memory was 178.7 MB in the beginning and 307.2 MB in the end (delta: -128.5 MB). Peak memory consumption was 226.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:36,962 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 678.74 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 165.3 MB in the end (delta: -62.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 102.58 ms. Allocated memory is still 203.9 MB. Free memory was 165.3 MB in the beginning and 159.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.12 ms. Allocated memory is still 203.9 MB. Free memory was 159.8 MB in the beginning and 155.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1924.57 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 155.1 MB in the beginning and 178.7 MB in the end (delta: -23.6 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7361.14 ms. Allocated memory was 245.9 MB in the beginning and 378.5 MB in the end (delta: 132.6 MB). Free memory was 178.7 MB in the beginning and 307.2 MB in the end (delta: -128.5 MB). Peak memory consumption was 226.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((a19 == 1 && a25 == 1) && 8 <= a28) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && a25 == 1)) || (a28 == 9 && a11 == 1)) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && 8 <= a28)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || (a19 <= 0 && ((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)))) || (a17 == 8 && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a19 == 1 && !(a28 == 11)) && 8 <= a28) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((a19 == 1 && a25 == 1) && 8 <= a28) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && a25 == 1)) || (a28 == 9 && a11 == 1)) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && 8 <= a28)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || (a19 <= 0 && ((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)))) || (a17 == 8 && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a19 == 1 && !(a28 == 11)) && 8 <= a28) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 7.2s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 646 SDtfs, 862 SDslu, 99 SDs, 0 SdLazy, 2658 SolverSat, 662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 454 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 345 HoareAnnotationTreeSize, 3 FomulaSimplifications, 946 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 530 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1397 ConstructedInterpolants, 0 QuantifiedInterpolants, 459999 SizeOfPredicates, 1 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1041 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...