/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:20,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:20,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:20,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:20,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:20,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:20,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:20,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:20,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:20,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:20,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:20,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:20,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:20,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:20,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:20,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:20,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:20,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:20,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:20,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:20,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:20,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:20,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:20,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:20,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:20,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:20,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:20,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:20,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:20,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:20,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:20,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:20,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:20,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:20,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:20,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:20,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:20,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:20,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:20,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:20,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:20,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:32:20,376 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:20,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:20,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:20,380 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:20,380 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:20,380 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:20,381 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:20,381 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:20,381 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:20,381 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:20,381 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:20,381 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:20,382 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:20,382 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:20,382 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:20,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:20,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:20,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:20,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:20,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:20,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:20,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:20,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:20,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:20,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:20,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:20,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:20,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:20,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:20,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:20,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:20,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:20,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:20,389 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:20,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:20,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:20,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:20,390 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:20,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:20,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:20,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:20,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:20,731 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:20,731 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label19.c [2019-11-23 23:32:20,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2a9a732/e196d1b39f54407ea26c50d7fdfd08f7/FLAG717dd9511 [2019-11-23 23:32:21,376 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:21,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label19.c [2019-11-23 23:32:21,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2a9a732/e196d1b39f54407ea26c50d7fdfd08f7/FLAG717dd9511 [2019-11-23 23:32:21,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2a9a732/e196d1b39f54407ea26c50d7fdfd08f7 [2019-11-23 23:32:21,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:21,686 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:21,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:21,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:21,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:21,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:21" (1/1) ... [2019-11-23 23:32:21,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:21, skipping insertion in model container [2019-11-23 23:32:21,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:21" (1/1) ... [2019-11-23 23:32:21,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:21,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:22,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:22,273 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:22,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:22,460 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:22,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22 WrapperNode [2019-11-23 23:32:22,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:22,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:22,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:22,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:22,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:22,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:22,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:22,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:22,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... [2019-11-23 23:32:22,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:22,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:22,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:22,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:22,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:22,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:22,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:24,739 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:24,739 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:24,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:24 BoogieIcfgContainer [2019-11-23 23:32:24,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:24,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:24,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:24,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:24,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:21" (1/3) ... [2019-11-23 23:32:24,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ce433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:24, skipping insertion in model container [2019-11-23 23:32:24,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:22" (2/3) ... [2019-11-23 23:32:24,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ce433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:24, skipping insertion in model container [2019-11-23 23:32:24,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:24" (3/3) ... [2019-11-23 23:32:24,749 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label19.c [2019-11-23 23:32:24,759 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:24,767 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:24,779 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:24,807 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:24,807 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:24,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:24,808 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:24,808 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:24,808 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:24,808 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:24,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:24,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:24,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:24,838 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:24,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:24,844 INFO L82 PathProgramCache]: Analyzing trace with hash 925945481, now seen corresponding path program 1 times [2019-11-23 23:32:24,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:24,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646299295] [2019-11-23 23:32:24,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:25,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646299295] [2019-11-23 23:32:25,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:25,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:25,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211593242] [2019-11-23 23:32:25,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:25,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:25,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:25,340 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:26,111 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:26,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:26,131 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:26,131 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:26,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2019-11-23 23:32:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 23:32:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2019-11-23 23:32:26,193 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2019-11-23 23:32:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:26,194 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2019-11-23 23:32:26,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2019-11-23 23:32:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:32:26,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:26,199 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:26,199 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1028666238, now seen corresponding path program 1 times [2019-11-23 23:32:26,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:26,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623745197] [2019-11-23 23:32:26,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:26,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623745197] [2019-11-23 23:32:26,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:26,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:26,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146661113] [2019-11-23 23:32:26,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:26,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:26,308 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand 3 states. [2019-11-23 23:32:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:26,719 INFO L93 Difference]: Finished difference Result 485 states and 891 transitions. [2019-11-23 23:32:26,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:26,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:32:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:26,723 INFO L225 Difference]: With dead ends: 485 [2019-11-23 23:32:26,723 INFO L226 Difference]: Without dead ends: 323 [2019-11-23 23:32:26,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-23 23:32:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 243. [2019-11-23 23:32:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 393 transitions. [2019-11-23 23:32:26,745 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 393 transitions. Word has length 84 [2019-11-23 23:32:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:26,746 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 393 transitions. [2019-11-23 23:32:26,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 393 transitions. [2019-11-23 23:32:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:32:26,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:26,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:26,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2010251948, now seen corresponding path program 1 times [2019-11-23 23:32:26,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:26,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728383949] [2019-11-23 23:32:26,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:26,923 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:32:26,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728383949] [2019-11-23 23:32:26,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:26,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:26,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452116844] [2019-11-23 23:32:26,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:26,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:26,926 INFO L87 Difference]: Start difference. First operand 243 states and 393 transitions. Second operand 4 states. [2019-11-23 23:32:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:27,719 INFO L93 Difference]: Finished difference Result 965 states and 1567 transitions. [2019-11-23 23:32:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:27,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-23 23:32:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:27,724 INFO L225 Difference]: With dead ends: 965 [2019-11-23 23:32:27,724 INFO L226 Difference]: Without dead ends: 643 [2019-11-23 23:32:27,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-11-23 23:32:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 563. [2019-11-23 23:32:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-23 23:32:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 858 transitions. [2019-11-23 23:32:27,759 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 858 transitions. Word has length 89 [2019-11-23 23:32:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:27,760 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 858 transitions. [2019-11-23 23:32:27,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 858 transitions. [2019-11-23 23:32:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 23:32:27,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:27,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:27,770 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash 972863425, now seen corresponding path program 1 times [2019-11-23 23:32:27,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:27,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026964733] [2019-11-23 23:32:27,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:27,880 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:32:27,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026964733] [2019-11-23 23:32:27,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:27,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:27,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485320523] [2019-11-23 23:32:27,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:27,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:27,884 INFO L87 Difference]: Start difference. First operand 563 states and 858 transitions. Second operand 3 states. [2019-11-23 23:32:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:28,264 INFO L93 Difference]: Finished difference Result 1605 states and 2476 transitions. [2019-11-23 23:32:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:28,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-23 23:32:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:28,270 INFO L225 Difference]: With dead ends: 1605 [2019-11-23 23:32:28,271 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:28,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 963. [2019-11-23 23:32:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1425 transitions. [2019-11-23 23:32:28,301 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1425 transitions. Word has length 108 [2019-11-23 23:32:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:28,301 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1425 transitions. [2019-11-23 23:32:28,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1425 transitions. [2019-11-23 23:32:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-23 23:32:28,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:28,307 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, 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] [2019-11-23 23:32:28,307 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash 504623297, now seen corresponding path program 1 times [2019-11-23 23:32:28,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:28,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663762957] [2019-11-23 23:32:28,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:28,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663762957] [2019-11-23 23:32:28,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:28,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:28,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299866919] [2019-11-23 23:32:28,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:28,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:28,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:28,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:28,426 INFO L87 Difference]: Start difference. First operand 963 states and 1425 transitions. Second operand 4 states. [2019-11-23 23:32:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:29,017 INFO L93 Difference]: Finished difference Result 2005 states and 2943 transitions. [2019-11-23 23:32:29,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:29,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-23 23:32:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:29,023 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:29,023 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:29,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-23 23:32:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1309 transitions. [2019-11-23 23:32:29,061 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1309 transitions. Word has length 138 [2019-11-23 23:32:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:29,062 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1309 transitions. [2019-11-23 23:32:29,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1309 transitions. [2019-11-23 23:32:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 23:32:29,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:29,071 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:29,071 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1508320036, now seen corresponding path program 1 times [2019-11-23 23:32:29,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:29,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115873788] [2019-11-23 23:32:29,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:29,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115873788] [2019-11-23 23:32:29,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:29,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:29,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981404694] [2019-11-23 23:32:29,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:29,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:29,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:29,185 INFO L87 Difference]: Start difference. First operand 1043 states and 1309 transitions. Second operand 3 states. [2019-11-23 23:32:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:29,596 INFO L93 Difference]: Finished difference Result 2245 states and 2796 transitions. [2019-11-23 23:32:29,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:29,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 23:32:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:29,603 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:32:29,604 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:32:29,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:32:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1123. [2019-11-23 23:32:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1361 transitions. [2019-11-23 23:32:29,628 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1361 transitions. Word has length 147 [2019-11-23 23:32:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:29,629 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1361 transitions. [2019-11-23 23:32:29,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1361 transitions. [2019-11-23 23:32:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 23:32:29,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:29,635 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:29,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 437729907, now seen corresponding path program 1 times [2019-11-23 23:32:29,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:29,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741726367] [2019-11-23 23:32:29,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-23 23:32:29,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741726367] [2019-11-23 23:32:29,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:29,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:29,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863651786] [2019-11-23 23:32:29,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:29,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:29,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:29,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:29,697 INFO L87 Difference]: Start difference. First operand 1123 states and 1361 transitions. Second operand 4 states. [2019-11-23 23:32:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:30,254 INFO L93 Difference]: Finished difference Result 2887 states and 3547 transitions. [2019-11-23 23:32:30,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:30,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-23 23:32:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:30,262 INFO L225 Difference]: With dead ends: 2887 [2019-11-23 23:32:30,262 INFO L226 Difference]: Without dead ends: 1765 [2019-11-23 23:32:30,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-23 23:32:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1203. [2019-11-23 23:32:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1384 transitions. [2019-11-23 23:32:30,291 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1384 transitions. Word has length 147 [2019-11-23 23:32:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:30,291 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1384 transitions. [2019-11-23 23:32:30,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1384 transitions. [2019-11-23 23:32:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 23:32:30,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:30,295 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:30,295 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash -176133275, now seen corresponding path program 1 times [2019-11-23 23:32:30,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:30,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473853948] [2019-11-23 23:32:30,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 23:32:30,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473853948] [2019-11-23 23:32:30,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:30,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:30,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601920174] [2019-11-23 23:32:30,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:30,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:30,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:30,342 INFO L87 Difference]: Start difference. First operand 1203 states and 1384 transitions. Second operand 3 states. [2019-11-23 23:32:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:30,723 INFO L93 Difference]: Finished difference Result 2565 states and 2956 transitions. [2019-11-23 23:32:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:30,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 23:32:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:30,728 INFO L225 Difference]: With dead ends: 2565 [2019-11-23 23:32:30,728 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:30,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1465 transitions. [2019-11-23 23:32:30,754 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1465 transitions. Word has length 156 [2019-11-23 23:32:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:30,754 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1465 transitions. [2019-11-23 23:32:30,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1465 transitions. [2019-11-23 23:32:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-23 23:32:30,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:30,758 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 23:32:30,759 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1537300160, now seen corresponding path program 1 times [2019-11-23 23:32:30,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:30,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507832482] [2019-11-23 23:32:30,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 23:32:30,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507832482] [2019-11-23 23:32:30,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:30,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:30,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245240305] [2019-11-23 23:32:30,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:30,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:30,864 INFO L87 Difference]: Start difference. First operand 1283 states and 1465 transitions. Second operand 4 states. [2019-11-23 23:32:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:31,518 INFO L93 Difference]: Finished difference Result 2965 states and 3441 transitions. [2019-11-23 23:32:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:31,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-23 23:32:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:31,525 INFO L225 Difference]: With dead ends: 2965 [2019-11-23 23:32:31,525 INFO L226 Difference]: Without dead ends: 1683 [2019-11-23 23:32:31,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-11-23 23:32:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1523. [2019-11-23 23:32:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-11-23 23:32:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1749 transitions. [2019-11-23 23:32:31,558 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1749 transitions. Word has length 170 [2019-11-23 23:32:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:31,558 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 1749 transitions. [2019-11-23 23:32:31,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1749 transitions. [2019-11-23 23:32:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 23:32:31,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:31,563 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:31,564 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1849514695, now seen corresponding path program 1 times [2019-11-23 23:32:31,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:31,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164338367] [2019-11-23 23:32:31,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 23:32:31,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164338367] [2019-11-23 23:32:31,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667708757] [2019-11-23 23:32:31,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:31,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:31,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-23 23:32:31,909 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-23 23:32:31,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:31,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-11-23 23:32:31,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309856217] [2019-11-23 23:32:31,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:31,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:32:31,958 INFO L87 Difference]: Start difference. First operand 1523 states and 1749 transitions. Second operand 3 states. [2019-11-23 23:32:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:32,140 INFO L93 Difference]: Finished difference Result 2805 states and 3209 transitions. [2019-11-23 23:32:32,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:32,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 23:32:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:32,144 INFO L225 Difference]: With dead ends: 2805 [2019-11-23 23:32:32,144 INFO L226 Difference]: Without dead ends: 723 [2019-11-23 23:32:32,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 371 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:32:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-23 23:32:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-23 23:32:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 23:32:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 769 transitions. [2019-11-23 23:32:32,162 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 769 transitions. Word has length 187 [2019-11-23 23:32:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:32,162 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 769 transitions. [2019-11-23 23:32:32,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 769 transitions. [2019-11-23 23:32:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-23 23:32:32,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:32,166 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:32,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:32,371 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash -502288677, now seen corresponding path program 1 times [2019-11-23 23:32:32,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:32,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901472943] [2019-11-23 23:32:32,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 23:32:32,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901472943] [2019-11-23 23:32:32,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:32,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:32,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271987380] [2019-11-23 23:32:32,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:32,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:32,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:32,565 INFO L87 Difference]: Start difference. First operand 723 states and 769 transitions. Second operand 4 states. [2019-11-23 23:32:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:33,094 INFO L93 Difference]: Finished difference Result 1365 states and 1455 transitions. [2019-11-23 23:32:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:33,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-23 23:32:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:33,098 INFO L225 Difference]: With dead ends: 1365 [2019-11-23 23:32:33,099 INFO L226 Difference]: Without dead ends: 723 [2019-11-23 23:32:33,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-23 23:32:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-23 23:32:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 23:32:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 765 transitions. [2019-11-23 23:32:33,113 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 765 transitions. Word has length 193 [2019-11-23 23:32:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:33,113 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 765 transitions. [2019-11-23 23:32:33,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 765 transitions. [2019-11-23 23:32:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 23:32:33,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:33,117 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:33,117 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:33,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1227022134, now seen corresponding path program 1 times [2019-11-23 23:32:33,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:33,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133827222] [2019-11-23 23:32:33,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:33,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133827222] [2019-11-23 23:32:33,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914608569] [2019-11-23 23:32:33,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:33,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:33,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-23 23:32:33,814 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-23 23:32:33,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:33,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [7] total 8 [2019-11-23 23:32:33,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757538805] [2019-11-23 23:32:33,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:33,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:33,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:33,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:33,953 INFO L87 Difference]: Start difference. First operand 723 states and 765 transitions. Second operand 3 states. [2019-11-23 23:32:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:34,141 INFO L93 Difference]: Finished difference Result 723 states and 765 transitions. [2019-11-23 23:32:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:34,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-23 23:32:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:34,143 INFO L225 Difference]: With dead ends: 723 [2019-11-23 23:32:34,143 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:34,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:34,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-11-23 23:32:34,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:34,146 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:34,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:34,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:34,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:34,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:34,833 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-11-23 23:32:35,203 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-11-23 23:32:35,208 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:35,209 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:35,209 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:35,209 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:35,209 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:35,209 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:35,209 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:35,209 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:35,210 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:35,210 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:35,210 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:35,210 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:35,210 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:35,210 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:35,210 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:35,211 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:35,211 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:35,211 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:35,211 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:35,212 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:35,213 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:35,214 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:35,214 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:35,214 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:35,214 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:35,214 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 448) no Hoare annotation was computed. [2019-11-23 23:32:35,214 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:35,214 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:35,215 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:35,215 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:35,215 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse2 (= ~a28~0 11)) (.cse0 (= ~a11~0 1)) (.cse10 (= ~a28~0 7)) (.cse7 (= ~a25~0 1))) (let ((.cse3 (<= 10 ~a28~0)) (.cse11 (not .cse7)) (.cse9 (<= 8 ~a17~0)) (.cse6 (not .cse10)) (.cse4 (= ~a19~0 1)) (.cse1 (<= ~a17~0 8)) (.cse8 (not .cse0)) (.cse5 (not .cse2))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse4 .cse1 .cse5) (and .cse6 (not (= ~a28~0 8)) .cse4 .cse1 .cse7 .cse8 .cse5) (and .cse9 .cse10 .cse1) (and .cse2 .cse4 .cse7 .cse1) (and .cse10 .cse1 .cse0) (and .cse3 .cse11 .cse0) (and (= ~a28~0 10) .cse9 .cse1) (and .cse9 .cse11 .cse1 .cse8 .cse5) (and .cse0 .cse7 .cse1) (and .cse9 .cse6 .cse4 .cse1 .cse7 .cse8 .cse5)))) [2019-11-23 23:32:35,215 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:35,215 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:35,216 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:35,216 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:35,216 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:35,216 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:35,216 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:35,216 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:35,216 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:35,216 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:35,217 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~a28~0 11)) (.cse0 (= ~a11~0 1)) (.cse10 (= ~a28~0 7)) (.cse7 (= ~a25~0 1))) (let ((.cse3 (<= 10 ~a28~0)) (.cse11 (not .cse7)) (.cse9 (<= 8 ~a17~0)) (.cse6 (not .cse10)) (.cse4 (= ~a19~0 1)) (.cse1 (<= ~a17~0 8)) (.cse8 (not .cse0)) (.cse5 (not .cse2))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse4 .cse1 .cse5) (and .cse6 (not (= ~a28~0 8)) .cse4 .cse1 .cse7 .cse8 .cse5) (and .cse9 .cse10 .cse1) (and .cse2 .cse4 .cse7 .cse1) (and .cse10 .cse1 .cse0) (and .cse3 .cse11 .cse0) (and (= ~a28~0 10) .cse9 .cse1) (and .cse9 .cse11 .cse1 .cse8 .cse5) (and .cse0 .cse7 .cse1) (and .cse9 .cse6 .cse4 .cse1 .cse7 .cse8 .cse5)))) [2019-11-23 23:32:35,217 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:35,217 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:35,217 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:35,217 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:35,217 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:35,217 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:35,218 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:35,218 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:35,218 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:35,218 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:35,218 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:35,221 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:35,221 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:35,221 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:35,221 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:35,221 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:35,221 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:35,222 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:35,223 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:35,223 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:35,223 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:35,223 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:35,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:35 BoogieIcfgContainer [2019-11-23 23:32:35,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:35,251 INFO L168 Benchmark]: Toolchain (without parser) took 13564.60 ms. Allocated memory was 142.6 MB in the beginning and 431.0 MB in the end (delta: 288.4 MB). Free memory was 100.3 MB in the beginning and 214.8 MB in the end (delta: -114.5 MB). Peak memory consumption was 173.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:35,252 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 142.6 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:35,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.80 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 100.1 MB in the beginning and 169.9 MB in the end (delta: -69.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:35,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.76 ms. Allocated memory is still 204.5 MB. Free memory was 169.9 MB in the beginning and 164.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:35,254 INFO L168 Benchmark]: Boogie Preprocessor took 107.35 ms. Allocated memory is still 204.5 MB. Free memory was 164.5 MB in the beginning and 159.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:35,255 INFO L168 Benchmark]: RCFGBuilder took 2074.50 ms. Allocated memory was 204.5 MB in the beginning and 248.5 MB in the end (delta: 44.0 MB). Free memory was 159.7 MB in the beginning and 189.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 112.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:35,256 INFO L168 Benchmark]: TraceAbstraction took 10507.19 ms. Allocated memory was 248.5 MB in the beginning and 431.0 MB in the end (delta: 182.5 MB). Free memory was 189.7 MB in the beginning and 214.8 MB in the end (delta: -25.1 MB). Peak memory consumption was 157.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:35,261 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.29 ms. Allocated memory is still 142.6 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.80 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 100.1 MB in the beginning and 169.9 MB in the end (delta: -69.8 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 97.76 ms. Allocated memory is still 204.5 MB. Free memory was 169.9 MB in the beginning and 164.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.35 ms. Allocated memory is still 204.5 MB. Free memory was 164.5 MB in the beginning and 159.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2074.50 ms. Allocated memory was 204.5 MB in the beginning and 248.5 MB in the end (delta: 44.0 MB). Free memory was 159.7 MB in the beginning and 189.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 112.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10507.19 ms. Allocated memory was 248.5 MB in the beginning and 431.0 MB in the end (delta: 182.5 MB). Free memory was 189.7 MB in the beginning and 214.8 MB in the end (delta: -25.1 MB). Peak memory consumption was 157.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 448]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || (a28 == 11 && a11 == 1)) || (((10 <= a28 && a19 == 1) && a17 <= 8) && !(a28 == 11))) || ((((((!(a28 == 7) && !(a28 == 8)) && a19 == 1) && a17 <= 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11))) || ((8 <= a17 && a28 == 7) && a17 <= 8)) || (((a28 == 11 && a19 == 1) && a25 == 1) && a17 <= 8)) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a28 == 10 && 8 <= a17) && a17 <= 8)) || ((((8 <= a17 && !(a25 == 1)) && a17 <= 8) && !(a11 == 1)) && !(a28 == 11))) || ((a11 == 1 && a25 == 1) && a17 <= 8)) || ((((((8 <= a17 && !(a28 == 7)) && a19 == 1) && a17 <= 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || (a28 == 11 && a11 == 1)) || (((10 <= a28 && a19 == 1) && a17 <= 8) && !(a28 == 11))) || ((((((!(a28 == 7) && !(a28 == 8)) && a19 == 1) && a17 <= 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11))) || ((8 <= a17 && a28 == 7) && a17 <= 8)) || (((a28 == 11 && a19 == 1) && a25 == 1) && a17 <= 8)) || ((a28 == 7 && a17 <= 8) && a11 == 1)) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a28 == 10 && 8 <= a17) && a17 <= 8)) || ((((8 <= a17 && !(a25 == 1)) && a17 <= 8) && !(a11 == 1)) && !(a28 == 11))) || ((a11 == 1 && a25 == 1) && a17 <= 8)) || ((((((8 <= a17 && !(a28 == 7)) && a19 == 1) && a17 <= 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 862 SDtfs, 1315 SDslu, 111 SDs, 0 SdLazy, 3817 SolverSat, 769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 842 GetRequests, 810 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=9, 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, 1122 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 333 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1518 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 612 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2112 NumberOfCodeBlocks, 2112 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2496 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030468 SizeOfPredicates, 2 NumberOfNonLiveVariables, 740 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 1999/2075 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...