/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/Problem01_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:51,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:51,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:51,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:51,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:51,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:51,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:51,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:51,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:51,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:51,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:51,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:51,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:51,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:51,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:51,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:51,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:51,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:51,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:51,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:51,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:51,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:51,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:51,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:51,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:51,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:51,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:51,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:51,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:51,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:51,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:51,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:51,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:51,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:51,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:51,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:51,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:51,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:51,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:51,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:51,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:51,404 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:30:51,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:51,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:51,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:51,420 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:51,420 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:51,420 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:51,421 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:51,421 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:51,421 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:51,421 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:51,421 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:51,422 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:51,422 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:51,422 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:51,422 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:51,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:51,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:51,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:51,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:51,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:51,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:51,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:51,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:51,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:51,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:51,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:51,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:51,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:51,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:51,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:51,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:51,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:51,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:51,426 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:51,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:51,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:51,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:51,427 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:51,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:51,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:51,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:51,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:51,722 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:51,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27.c [2019-11-23 23:30:51,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0718c1646/27261dedae54444a8450fe3acbec161e/FLAGa60bdb492 [2019-11-23 23:30:52,378 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:52,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label27.c [2019-11-23 23:30:52,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0718c1646/27261dedae54444a8450fe3acbec161e/FLAGa60bdb492 [2019-11-23 23:30:52,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0718c1646/27261dedae54444a8450fe3acbec161e [2019-11-23 23:30:52,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:52,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:52,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:52,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:52,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:52,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:52" (1/1) ... [2019-11-23 23:30:52,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cd6fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:52, skipping insertion in model container [2019-11-23 23:30:52,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:52" (1/1) ... [2019-11-23 23:30:52,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:52,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:53,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:53,263 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:53,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:53,421 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:53,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53 WrapperNode [2019-11-23 23:30:53,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:53,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:53,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:53,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:53,431 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:30:53" (1/1) ... [2019-11-23 23:30:53,449 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:30:53" (1/1) ... [2019-11-23 23:30:53,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:53,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:53,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:53,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:53,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:53,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:53,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:53,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:53,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (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:30:53,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:53,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:55,646 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:55,646 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:55,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:55 BoogieIcfgContainer [2019-11-23 23:30:55,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:55,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:55,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:55,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:55,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:52" (1/3) ... [2019-11-23 23:30:55,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca21f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:55, skipping insertion in model container [2019-11-23 23:30:55,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53" (2/3) ... [2019-11-23 23:30:55,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca21f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:55, skipping insertion in model container [2019-11-23 23:30:55,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:55" (3/3) ... [2019-11-23 23:30:55,656 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label27.c [2019-11-23 23:30:55,666 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:55,674 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:55,686 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:55,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:55,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:55,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:55,719 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:55,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:55,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:55,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:55,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:55,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:55,756 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] [2019-11-23 23:30:55,757 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:55,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1323245599, now seen corresponding path program 1 times [2019-11-23 23:30:55,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:55,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607503686] [2019-11-23 23:30:55,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:56,203 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:30:56,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607503686] [2019-11-23 23:30:56,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:56,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:56,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124549881] [2019-11-23 23:30:56,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:56,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:56,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:56,230 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:30:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:56,737 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:30:56,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:56,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:30:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:56,764 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:30:56,764 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:30:56,769 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:30:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:30:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:30:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:56,826 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:56,827 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:56,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:30:56,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:56,831 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:56,832 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash 585772121, now seen corresponding path program 1 times [2019-11-23 23:30:56,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:56,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011761041] [2019-11-23 23:30:56,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:56,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011761041] [2019-11-23 23:30:56,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:56,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:56,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956579518] [2019-11-23 23:30:56,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:56,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:56,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:56,898 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:57,406 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-23 23:30:57,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:57,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:30:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:57,409 INFO L225 Difference]: With dead ends: 431 [2019-11-23 23:30:57,410 INFO L226 Difference]: Without dead ends: 287 [2019-11-23 23:30:57,411 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:30:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-23 23:30:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-23 23:30:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:30:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 480 transitions. [2019-11-23 23:30:57,438 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 480 transitions. Word has length 76 [2019-11-23 23:30:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:57,439 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 480 transitions. [2019-11-23 23:30:57,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 480 transitions. [2019-11-23 23:30:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:30:57,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:57,442 INFO L410 BasicCegarLoop]: trace histogram [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:30:57,443 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:57,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash 919984079, now seen corresponding path program 1 times [2019-11-23 23:30:57,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:57,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176721630] [2019-11-23 23:30:57,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:57,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176721630] [2019-11-23 23:30:57,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:57,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:57,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939674003] [2019-11-23 23:30:57,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:57,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:57,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:57,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:57,513 INFO L87 Difference]: Start difference. First operand 287 states and 480 transitions. Second operand 4 states. [2019-11-23 23:30:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:58,220 INFO L93 Difference]: Finished difference Result 1141 states and 1915 transitions. [2019-11-23 23:30:58,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:58,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:30:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:58,226 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:30:58,226 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:30:58,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:30:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:30:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-23 23:30:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1328 transitions. [2019-11-23 23:30:58,279 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1328 transitions. Word has length 80 [2019-11-23 23:30:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:58,279 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1328 transitions. [2019-11-23 23:30:58,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1328 transitions. [2019-11-23 23:30:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 23:30:58,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:58,287 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-23 23:30:58,290 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1341144070, now seen corresponding path program 1 times [2019-11-23 23:30:58,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:58,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865016596] [2019-11-23 23:30:58,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 23:30:58,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865016596] [2019-11-23 23:30:58,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:58,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:58,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219025133] [2019-11-23 23:30:58,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:58,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:58,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:58,363 INFO L87 Difference]: Start difference. First operand 855 states and 1328 transitions. Second operand 3 states. [2019-11-23 23:30:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:58,758 INFO L93 Difference]: Finished difference Result 1851 states and 2900 transitions. [2019-11-23 23:30:58,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:58,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 23:30:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:58,764 INFO L225 Difference]: With dead ends: 1851 [2019-11-23 23:30:58,764 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:58,766 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:30:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 713. [2019-11-23 23:30:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1101 transitions. [2019-11-23 23:30:58,791 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1101 transitions. Word has length 83 [2019-11-23 23:30:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:58,792 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1101 transitions. [2019-11-23 23:30:58,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1101 transitions. [2019-11-23 23:30:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 23:30:58,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:58,794 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 23:30:58,795 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1986457344, now seen corresponding path program 1 times [2019-11-23 23:30:58,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:58,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118881047] [2019-11-23 23:30:58,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:58,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118881047] [2019-11-23 23:30:58,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:58,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:58,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413572772] [2019-11-23 23:30:58,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:58,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:58,875 INFO L87 Difference]: Start difference. First operand 713 states and 1101 transitions. Second operand 4 states. [2019-11-23 23:30:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:59,440 INFO L93 Difference]: Finished difference Result 1516 states and 2310 transitions. [2019-11-23 23:30:59,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:59,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-23 23:30:59,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:59,444 INFO L225 Difference]: With dead ends: 1516 [2019-11-23 23:30:59,445 INFO L226 Difference]: Without dead ends: 804 [2019-11-23 23:30:59,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-11-23 23:30:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 784. [2019-11-23 23:30:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1178 transitions. [2019-11-23 23:30:59,469 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1178 transitions. Word has length 86 [2019-11-23 23:30:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:59,470 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1178 transitions. [2019-11-23 23:30:59,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1178 transitions. [2019-11-23 23:30:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 23:30:59,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:59,472 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 23:30:59,473 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1981861432, now seen corresponding path program 1 times [2019-11-23 23:30:59,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:59,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243983156] [2019-11-23 23:30:59,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:59,528 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:30:59,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243983156] [2019-11-23 23:30:59,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:59,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:59,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857110954] [2019-11-23 23:30:59,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:59,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:59,531 INFO L87 Difference]: Start difference. First operand 784 states and 1178 transitions. Second operand 4 states. [2019-11-23 23:31:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:00,037 INFO L93 Difference]: Finished difference Result 1496 states and 2278 transitions. [2019-11-23 23:31:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:00,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-23 23:31:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:00,042 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 23:31:00,042 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:00,044 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:31:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-23 23:31:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1160 transitions. [2019-11-23 23:31:00,063 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1160 transitions. Word has length 90 [2019-11-23 23:31:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:00,064 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1160 transitions. [2019-11-23 23:31:00,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1160 transitions. [2019-11-23 23:31:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 23:31:00,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,066 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 23:31:00,067 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1637095950, now seen corresponding path program 1 times [2019-11-23 23:31:00,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929152211] [2019-11-23 23:31:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:00,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929152211] [2019-11-23 23:31:00,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:00,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110911156] [2019-11-23 23:31:00,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:00,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:00,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:00,121 INFO L87 Difference]: Start difference. First operand 784 states and 1160 transitions. Second operand 3 states. [2019-11-23 23:31:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:00,514 INFO L93 Difference]: Finished difference Result 1496 states and 2242 transitions. [2019-11-23 23:31:00,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:00,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-23 23:31:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:00,518 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 23:31:00,519 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:00,520 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:31:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-23 23:31:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1148 transitions. [2019-11-23 23:31:00,542 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1148 transitions. Word has length 91 [2019-11-23 23:31:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:00,544 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1148 transitions. [2019-11-23 23:31:00,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1148 transitions. [2019-11-23 23:31:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:00,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,548 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 23:31:00,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1728902547, now seen corresponding path program 1 times [2019-11-23 23:31:00,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30057557] [2019-11-23 23:31:00,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:00,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30057557] [2019-11-23 23:31:00,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:00,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469302598] [2019-11-23 23:31:00,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:00,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:00,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:00,633 INFO L87 Difference]: Start difference. First operand 784 states and 1148 transitions. Second operand 3 states. [2019-11-23 23:31:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:00,963 INFO L93 Difference]: Finished difference Result 1709 states and 2517 transitions. [2019-11-23 23:31:00,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:00,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:31:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:00,969 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:31:00,970 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:31:00,971 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:31:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:31:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 855. [2019-11-23 23:31:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1024 transitions. [2019-11-23 23:31:00,991 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1024 transitions. Word has length 93 [2019-11-23 23:31:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:00,992 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1024 transitions. [2019-11-23 23:31:00,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1024 transitions. [2019-11-23 23:31:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 23:31:00,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,994 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, 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] [2019-11-23 23:31:00,994 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2105522167, now seen corresponding path program 1 times [2019-11-23 23:31:00,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76870892] [2019-11-23 23:31:00,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:01,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76870892] [2019-11-23 23:31:01,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:01,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:01,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208198464] [2019-11-23 23:31:01,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:01,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:01,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:01,089 INFO L87 Difference]: Start difference. First operand 855 states and 1024 transitions. Second operand 4 states. [2019-11-23 23:31:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:01,632 INFO L93 Difference]: Finished difference Result 1709 states and 2069 transitions. [2019-11-23 23:31:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:01,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-23 23:31:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:01,638 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:31:01,638 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:31:01,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:31:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:31:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-23 23:31:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 888 transitions. [2019-11-23 23:31:01,655 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 888 transitions. Word has length 108 [2019-11-23 23:31:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:01,655 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 888 transitions. [2019-11-23 23:31:01,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 888 transitions. [2019-11-23 23:31:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:31:01,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:01,658 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:31:01,659 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1361905208, now seen corresponding path program 1 times [2019-11-23 23:31:01,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:01,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321982343] [2019-11-23 23:31:01,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:31:01,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321982343] [2019-11-23 23:31:01,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:01,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:01,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221287322] [2019-11-23 23:31:01,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:01,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:01,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:01,747 INFO L87 Difference]: Start difference. First operand 784 states and 888 transitions. Second operand 3 states. [2019-11-23 23:31:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:02,057 INFO L93 Difference]: Finished difference Result 1993 states and 2281 transitions. [2019-11-23 23:31:02,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:02,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 23:31:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:02,070 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:31:02,070 INFO L226 Difference]: Without dead ends: 1210 [2019-11-23 23:31:02,076 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:31:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-23 23:31:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2019-11-23 23:31:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-11-23 23:31:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1362 transitions. [2019-11-23 23:31:02,102 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1362 transitions. Word has length 121 [2019-11-23 23:31:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:02,102 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1362 transitions. [2019-11-23 23:31:02,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1362 transitions. [2019-11-23 23:31:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-23 23:31:02,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:02,105 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:02,106 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1351609120, now seen corresponding path program 1 times [2019-11-23 23:31:02,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:02,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726688470] [2019-11-23 23:31:02,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:02,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726688470] [2019-11-23 23:31:02,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050351438] [2019-11-23 23:31:02,332 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:31:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:02,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:02,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:31:02,512 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 23:31:02,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:02,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:31:02,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266970589] [2019-11-23 23:31:02,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:02,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:02,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:02,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:02,547 INFO L87 Difference]: Start difference. First operand 1210 states and 1362 transitions. Second operand 3 states. [2019-11-23 23:31:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:02,844 INFO L93 Difference]: Finished difference Result 2632 states and 2981 transitions. [2019-11-23 23:31:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:02,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-23 23:31:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:02,849 INFO L225 Difference]: With dead ends: 2632 [2019-11-23 23:31:02,849 INFO L226 Difference]: Without dead ends: 1210 [2019-11-23 23:31:02,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-23 23:31:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 997. [2019-11-23 23:31:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1116 transitions. [2019-11-23 23:31:02,876 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1116 transitions. Word has length 138 [2019-11-23 23:31:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:02,876 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1116 transitions. [2019-11-23 23:31:02,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1116 transitions. [2019-11-23 23:31:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 23:31:02,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:02,879 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:31:03,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:03,083 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -748095685, now seen corresponding path program 1 times [2019-11-23 23:31:03,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:03,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142221829] [2019-11-23 23:31:03,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:03,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142221829] [2019-11-23 23:31:03,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:03,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 23:31:03,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133194086] [2019-11-23 23:31:03,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 23:31:03,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 23:31:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-23 23:31:03,839 INFO L87 Difference]: Start difference. First operand 997 states and 1116 transitions. Second operand 12 states. [2019-11-23 23:31:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:04,749 INFO L93 Difference]: Finished difference Result 1972 states and 2204 transitions. [2019-11-23 23:31:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 23:31:04,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-11-23 23:31:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:04,750 INFO L225 Difference]: With dead ends: 1972 [2019-11-23 23:31:04,750 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:04,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-23 23:31:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:04,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2019-11-23 23:31:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:04,754 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:04,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 23:31:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:04,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:04,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:05,236 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-23 23:31:05,694 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-23 23:31:05,698 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:05,698 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:05,699 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:05,699 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:05,699 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:05,699 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:05,699 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:05,699 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:05,699 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:05,700 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:05,700 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:05,700 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:05,700 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:05,700 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:05,700 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:05,700 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:05,701 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:05,701 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:05,701 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 23:31:05,701 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:05,702 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a16~0 5)) (.cse3 (= ~a16~0 6)) (.cse4 (= 1 ~a7~0))) (let ((.cse5 (not (= ~a20~0 1))) (.cse10 (not .cse4)) (.cse6 (not .cse3)) (.cse0 (= ~a17~0 1)) (.cse7 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse8 (= 15 ~a8~0)) (.cse11 (not .cse9)) (.cse2 (<= ~a8~0 14))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse1) (and .cse5 .cse7 .cse1 .cse8 .cse9) (and .cse10 .cse7 .cse1 .cse11 .cse8) (and .cse5 .cse1 .cse2 .cse9) (and .cse4 .cse6 .cse0 .cse1) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse7 (<= ~a17~0 0) .cse10 .cse1 .cse8) (and .cse4 .cse1 .cse2) (and .cse4 .cse0 .cse2) (and .cse6 .cse1 .cse11 .cse2) (and .cse0 .cse7 .cse1 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse8 .cse9) (and .cse4 .cse11 .cse2)))) [2019-11-23 23:31:05,702 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:05,702 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:05,702 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:05,702 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:05,702 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:05,702 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:05,703 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:05,703 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:05,704 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:05,704 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:05,704 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:05,704 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:05,704 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:05,704 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:05,705 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:05,706 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a16~0 5)) (.cse6 (= ~a16~0 6)) (.cse7 (= 1 ~a7~0))) (let ((.cse8 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse7)) (.cse3 (= 15 ~a8~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not .cse6)) (.cse2 (= ~a21~0 1)) (.cse11 (not .cse4)) (.cse5 (<= ~a8~0 14))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse1 .cse2 .cse11 .cse3) (and .cse8 .cse2 .cse5 .cse4) (and .cse7 .cse9 .cse0 .cse2) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 (<= ~a17~0 0) .cse10 .cse2 .cse3) (and .cse7 .cse2 .cse5) (and .cse7 .cse0 .cse5) (and .cse9 .cse2 .cse11 .cse5) (and .cse7 .cse11 .cse5)))) [2019-11-23 23:31:05,706 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:05,706 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:05,706 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:05,706 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:05,706 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:05,707 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:05,708 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:05,709 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:05,709 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:05,709 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:05,709 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:05,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:05 BoogieIcfgContainer [2019-11-23 23:31:05,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:05,735 INFO L168 Benchmark]: Toolchain (without parser) took 13097.22 ms. Allocated memory was 143.7 MB in the beginning and 434.6 MB in the end (delta: 291.0 MB). Free memory was 98.3 MB in the beginning and 329.3 MB in the end (delta: -231.0 MB). Peak memory consumption was 261.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:05,736 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:05,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.63 ms. Allocated memory was 143.7 MB in the beginning and 203.4 MB in the end (delta: 59.8 MB). Free memory was 98.1 MB in the beginning and 169.4 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:05,738 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.46 ms. Allocated memory is still 203.4 MB. Free memory was 169.4 MB in the beginning and 163.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:05,738 INFO L168 Benchmark]: Boogie Preprocessor took 66.72 ms. Allocated memory is still 203.4 MB. Free memory was 163.1 MB in the beginning and 158.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:05,739 INFO L168 Benchmark]: RCFGBuilder took 2070.41 ms. Allocated memory was 203.4 MB in the beginning and 253.2 MB in the end (delta: 49.8 MB). Free memory was 158.8 MB in the beginning and 211.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 114.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:05,740 INFO L168 Benchmark]: TraceAbstraction took 10084.57 ms. Allocated memory was 253.2 MB in the beginning and 434.6 MB in the end (delta: 181.4 MB). Free memory was 211.8 MB in the beginning and 329.3 MB in the end (delta: -117.5 MB). Peak memory consumption was 265.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:05,745 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.30 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.63 ms. Allocated memory was 143.7 MB in the beginning and 203.4 MB in the end (delta: 59.8 MB). Free memory was 98.1 MB in the beginning and 169.4 MB in the end (delta: -71.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.46 ms. Allocated memory is still 203.4 MB. Free memory was 169.4 MB in the beginning and 163.1 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.72 ms. Allocated memory is still 203.4 MB. Free memory was 163.1 MB in the beginning and 158.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2070.41 ms. Allocated memory was 203.4 MB in the beginning and 253.2 MB in the end (delta: 49.8 MB). Free memory was 158.8 MB in the beginning and 211.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 114.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10084.57 ms. Allocated memory was 253.2 MB in the beginning and 434.6 MB in the end (delta: 181.4 MB). Free memory was 211.8 MB in the beginning and 329.3 MB in the end (delta: -117.5 MB). Peak memory consumption was 265.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((((((a17 == 1 && a21 == 1) && a8 <= 14) && a16 == 6) || (((1 == a7 && !(a20 == 1)) && !(a16 == 6)) && a21 == 1)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && !(a16 == 5)) && 15 == a8)) || (((!(a20 == 1) && a21 == 1) && a8 <= 14) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((((((2 == input || 3 == input) || 6 == input) || 5 == input) && a12 == 8) && a17 <= 0) && !(1 == a7)) && a21 == 1) && 15 == a8)) || ((1 == a7 && a21 == 1) && a8 <= 14)) || ((1 == a7 && a17 == 1) && a8 <= 14)) || (((!(a16 == 6) && a21 == 1) && !(a16 == 5)) && a8 <= 14)) || (((((a17 == 1 && a12 == 8) && a21 == 1) && !(1 == input)) && 15 == a8) && a16 == 5)) || ((1 == a7 && !(a16 == 5)) && a8 <= 14) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5) || (((a17 == 1 && a21 == 1) && a8 <= 14) && a16 == 6)) || (((1 == a7 && !(a20 == 1)) && !(a16 == 6)) && a21 == 1)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && !(a16 == 5)) && 15 == a8)) || (((!(a20 == 1) && a21 == 1) && a8 <= 14) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((((((2 == input || 3 == input) || 6 == input) || 5 == input) && a12 == 8) && a17 <= 0) && !(1 == a7)) && a21 == 1) && 15 == a8)) || ((1 == a7 && a21 == 1) && a8 <= 14)) || ((1 == a7 && a17 == 1) && a8 <= 14)) || (((!(a16 == 6) && a21 == 1) && !(a16 == 5)) && a8 <= 14)) || ((1 == a7 && !(a16 == 5)) && a8 <= 14) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.9s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 728 SDtfs, 1251 SDslu, 78 SDs, 0 SdLazy, 3565 SolverSat, 715 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=10, 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, 12 MinimizatonAttempts, 730 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 47 NumberOfFragments, 373 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3021 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 218 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1315 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 807347 SizeOfPredicates, 1 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 585/586 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...