/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_label27.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:39,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:39,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:39,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:39,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:39,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:39,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:39,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:39,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:39,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:39,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:39,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:39,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:39,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:39,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:39,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:39,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:39,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:39,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:39,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:39,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:39,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:39,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:39,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:39,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:39,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:39,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:39,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:39,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:39,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:39,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:39,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:39,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:39,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:39,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:39,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:39,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:39,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:39,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:39,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:39,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:39,147 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:39,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:39,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:39,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:39,163 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:39,163 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:39,164 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:39,164 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:39,164 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:39,164 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:39,164 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:39,165 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:39,165 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:39,165 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:39,165 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:39,165 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:39,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:39,167 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:39,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:39,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:39,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:39,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:39,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:39,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:39,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:39,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:39,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:39,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:39,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:39,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:39,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:39,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:39,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:39,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:39,171 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:39,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:39,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:39,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:39,172 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:39,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:39,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:39,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:39,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:39,476 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:39,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label27.c [2019-11-23 23:32:39,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089536e18/ad43b00b5a724ac2997a2330a1a5cf92/FLAGd0d2abfe3 [2019-11-23 23:32:40,083 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:40,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label27.c [2019-11-23 23:32:40,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089536e18/ad43b00b5a724ac2997a2330a1a5cf92/FLAGd0d2abfe3 [2019-11-23 23:32:40,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089536e18/ad43b00b5a724ac2997a2330a1a5cf92 [2019-11-23 23:32:40,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:40,405 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:40,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:40,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:40,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:40,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:40" (1/1) ... [2019-11-23 23:32:40,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9af589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40, skipping insertion in model container [2019-11-23 23:32:40,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:40" (1/1) ... [2019-11-23 23:32:40,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:40,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:40,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:41,002 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:41,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:41,122 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:41,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:41 WrapperNode [2019-11-23 23:32:41,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:41,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:41,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:41,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:41,133 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:41" (1/1) ... [2019-11-23 23:32:41,165 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:41" (1/1) ... [2019-11-23 23:32:41,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:41,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:41,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:41,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:41,266 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:41" (1/1) ... [2019-11-23 23:32:41,266 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:41" (1/1) ... [2019-11-23 23:32:41,276 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:41" (1/1) ... [2019-11-23 23:32:41,277 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:41" (1/1) ... [2019-11-23 23:32:41,311 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:41" (1/1) ... [2019-11-23 23:32:41,329 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:41" (1/1) ... [2019-11-23 23:32:41,341 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:41" (1/1) ... [2019-11-23 23:32:41,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:41,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:41,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:41,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:41,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:41" (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:41,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:41,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:43,333 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:43,333 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:43,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:43 BoogieIcfgContainer [2019-11-23 23:32:43,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:43,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:43,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:43,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:43,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:40" (1/3) ... [2019-11-23 23:32:43,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6c2412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:43, skipping insertion in model container [2019-11-23 23:32:43,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:41" (2/3) ... [2019-11-23 23:32:43,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6c2412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:43, skipping insertion in model container [2019-11-23 23:32:43,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:43" (3/3) ... [2019-11-23 23:32:43,344 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label27.c [2019-11-23 23:32:43,353 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:43,362 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:43,373 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:43,408 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:43,408 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:43,409 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:43,409 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:43,409 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:43,410 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:43,410 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:43,410 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:43,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:43,449 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:43,450 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 925946249, now seen corresponding path program 1 times [2019-11-23 23:32:43,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:43,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909842405] [2019-11-23 23:32:43,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:43,854 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:43,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909842405] [2019-11-23 23:32:43,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:43,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:43,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195686565] [2019-11-23 23:32:43,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:43,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:43,884 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:44,751 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:44,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:44,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:44,768 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:44,769 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:44,772 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:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-11-23 23:32:44,834 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-11-23 23:32:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:44,835 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-11-23 23:32:44,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-11-23 23:32:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 23:32:44,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:44,840 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:44,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2010252716, now seen corresponding path program 1 times [2019-11-23 23:32:44,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:44,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751798473] [2019-11-23 23:32:44,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:44,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751798473] [2019-11-23 23:32:44,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:44,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:44,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93207274] [2019-11-23 23:32:44,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:44,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:45,001 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 4 states. [2019-11-23 23:32:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:45,530 INFO L93 Difference]: Finished difference Result 805 states and 1286 transitions. [2019-11-23 23:32:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:45,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-23 23:32:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:45,535 INFO L225 Difference]: With dead ends: 805 [2019-11-23 23:32:45,536 INFO L226 Difference]: Without dead ends: 563 [2019-11-23 23:32:45,538 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:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-23 23:32:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 483. [2019-11-23 23:32:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-23 23:32:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 758 transitions. [2019-11-23 23:32:45,614 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 758 transitions. Word has length 89 [2019-11-23 23:32:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:45,615 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 758 transitions. [2019-11-23 23:32:45,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 758 transitions. [2019-11-23 23:32:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:32:45,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:45,633 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:45,633 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:45,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:45,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1900024184, now seen corresponding path program 1 times [2019-11-23 23:32:45,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:45,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18026896] [2019-11-23 23:32:45,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:45,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18026896] [2019-11-23 23:32:45,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:45,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:45,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118687587] [2019-11-23 23:32:45,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:45,696 INFO L87 Difference]: Start difference. First operand 483 states and 758 transitions. Second operand 3 states. [2019-11-23 23:32:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:46,105 INFO L93 Difference]: Finished difference Result 1285 states and 2020 transitions. [2019-11-23 23:32:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:46,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-23 23:32:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:46,112 INFO L225 Difference]: With dead ends: 1285 [2019-11-23 23:32:46,112 INFO L226 Difference]: Without dead ends: 803 [2019-11-23 23:32:46,115 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:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-11-23 23:32:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2019-11-23 23:32:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-23 23:32:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1153 transitions. [2019-11-23 23:32:46,139 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1153 transitions. Word has length 113 [2019-11-23 23:32:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:46,139 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1153 transitions. [2019-11-23 23:32:46,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1153 transitions. [2019-11-23 23:32:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:32:46,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:46,145 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:46,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:46,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:46,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1735822193, now seen corresponding path program 1 times [2019-11-23 23:32:46,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:46,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558325031] [2019-11-23 23:32:46,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:46,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558325031] [2019-11-23 23:32:46,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:46,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:46,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844917474] [2019-11-23 23:32:46,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:46,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:46,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:46,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:46,223 INFO L87 Difference]: Start difference. First operand 803 states and 1153 transitions. Second operand 4 states. [2019-11-23 23:32:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:47,006 INFO L93 Difference]: Finished difference Result 2005 states and 2890 transitions. [2019-11-23 23:32:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:47,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:32:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:47,015 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:47,015 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:32:47,017 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:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:32:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 803. [2019-11-23 23:32:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-23 23:32:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1058 transitions. [2019-11-23 23:32:47,043 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1058 transitions. Word has length 118 [2019-11-23 23:32:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:47,043 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1058 transitions. [2019-11-23 23:32:47,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1058 transitions. [2019-11-23 23:32:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:32:47,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:47,048 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:47,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:47,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1692477709, now seen corresponding path program 1 times [2019-11-23 23:32:47,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:47,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829075914] [2019-11-23 23:32:47,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:47,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829075914] [2019-11-23 23:32:47,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:47,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:47,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628822955] [2019-11-23 23:32:47,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:47,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:47,141 INFO L87 Difference]: Start difference. First operand 803 states and 1058 transitions. Second operand 3 states. [2019-11-23 23:32:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:47,506 INFO L93 Difference]: Finished difference Result 2085 states and 2741 transitions. [2019-11-23 23:32:47,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:47,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 23:32:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:47,515 INFO L225 Difference]: With dead ends: 2085 [2019-11-23 23:32:47,516 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:32:47,518 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:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:32:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1043. [2019-11-23 23:32:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1345 transitions. [2019-11-23 23:32:47,558 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1345 transitions. Word has length 131 [2019-11-23 23:32:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:47,560 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1345 transitions. [2019-11-23 23:32:47,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1345 transitions. [2019-11-23 23:32:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 23:32:47,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:47,565 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:47,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1947459782, now seen corresponding path program 1 times [2019-11-23 23:32:47,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:47,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097555655] [2019-11-23 23:32:47,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:32:47,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097555655] [2019-11-23 23:32:47,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:47,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:47,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124715303] [2019-11-23 23:32:47,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:47,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:47,699 INFO L87 Difference]: Start difference. First operand 1043 states and 1345 transitions. Second operand 3 states. [2019-11-23 23:32:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:48,122 INFO L93 Difference]: Finished difference Result 2485 states and 3180 transitions. [2019-11-23 23:32:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:48,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-23 23:32:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:48,129 INFO L225 Difference]: With dead ends: 2485 [2019-11-23 23:32:48,129 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:48,132 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:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 963. [2019-11-23 23:32:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1153 transitions. [2019-11-23 23:32:48,155 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1153 transitions. Word has length 140 [2019-11-23 23:32:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:48,155 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1153 transitions. [2019-11-23 23:32:48,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1153 transitions. [2019-11-23 23:32:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 23:32:48,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:48,159 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,159 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 283710413, now seen corresponding path program 1 times [2019-11-23 23:32:48,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:48,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990001934] [2019-11-23 23:32:48,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-23 23:32:48,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990001934] [2019-11-23 23:32:48,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:48,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:48,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978057230] [2019-11-23 23:32:48,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:48,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:48,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:48,286 INFO L87 Difference]: Start difference. First operand 963 states and 1153 transitions. Second operand 3 states. [2019-11-23 23:32:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:48,546 INFO L93 Difference]: Finished difference Result 2005 states and 2387 transitions. [2019-11-23 23:32:48,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:48,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 23:32:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:48,552 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:48,552 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:48,554 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:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 963. [2019-11-23 23:32:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1138 transitions. [2019-11-23 23:32:48,579 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1138 transitions. Word has length 150 [2019-11-23 23:32:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:48,579 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1138 transitions. [2019-11-23 23:32:48,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1138 transitions. [2019-11-23 23:32:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 23:32:48,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:48,583 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:48,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash -275473213, now seen corresponding path program 1 times [2019-11-23 23:32:48,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:48,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233942755] [2019-11-23 23:32:48,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 94 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-23 23:32:48,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233942755] [2019-11-23 23:32:48,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408792258] [2019-11-23 23:32:48,718 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:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:48,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:48,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:32:48,921 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:32:48,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:48,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-11-23 23:32:48,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835262502] [2019-11-23 23:32:48,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:48,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:48,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:48,966 INFO L87 Difference]: Start difference. First operand 963 states and 1138 transitions. Second operand 4 states. [2019-11-23 23:32:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:49,380 INFO L93 Difference]: Finished difference Result 1683 states and 1954 transitions. [2019-11-23 23:32:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:49,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-23 23:32:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:49,381 INFO L225 Difference]: With dead ends: 1683 [2019-11-23 23:32:49,381 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:49,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:49,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2019-11-23 23:32:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:49,386 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:49,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:49,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:49,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:49,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:49,782 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-23 23:32:49,940 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-23 23:32:49,945 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:49,946 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:49,946 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:49,946 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:49,946 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:49,946 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:49,946 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:49,947 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:49,947 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:49,947 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:49,947 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:49,947 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:49,947 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:49,948 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:49,949 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:49,949 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:49,949 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:49,949 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:49,949 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:49,950 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:49,950 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:49,950 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:49,950 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:49,950 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:49,951 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:49,951 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:49,951 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:49,953 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:49,953 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:49,953 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:49,953 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:49,954 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-23 23:32:49,954 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:49,954 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:49,954 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:49,954 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:49,954 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:49,955 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:49,955 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:49,955 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 457) no Hoare annotation was computed. [2019-11-23 23:32:49,955 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:49,958 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:49,959 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:49,959 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:49,961 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse4 (= ~a19~0 1)) (.cse6 (not (= ~a28~0 11))) (.cse5 (= ~a17~0 8))) (let ((.cse0 (or (and (not .cse4) .cse6) (and (<= ~a19~0 0) .cse5))) (.cse2 (<= ~a17~0 7)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a25~0 1))) (or (and .cse0 .cse1) (and .cse2 (= ~a28~0 7) .cse1) (and (< ~a17~0 9) .cse0) (and .cse2 (not .cse3) .cse4 .cse1) (and .cse5 .cse4 .cse3) (and .cse5 .cse6)))) [2019-11-23 23:32:49,961 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:49,961 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:49,961 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:49,961 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:49,965 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:49,966 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:49,966 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:49,967 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:49,967 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:49,967 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:49,967 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a19~0 1)) (.cse6 (not (= ~a28~0 11))) (.cse5 (= ~a17~0 8))) (let ((.cse0 (or (and (not .cse4) .cse6) (and (<= ~a19~0 0) .cse5))) (.cse2 (<= ~a17~0 7)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a25~0 1))) (or (and .cse0 .cse1) (and .cse2 (= ~a28~0 7) .cse1) (and (< ~a17~0 9) .cse0) (and .cse2 (not .cse3) .cse4 .cse1) (and .cse5 .cse4 .cse3) (and .cse5 .cse6)))) [2019-11-23 23:32:49,967 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:49,968 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:49,968 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:49,968 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:49,968 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:49,968 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:49,968 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:49,970 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:49,970 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:49,970 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:49,970 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:49,971 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:49,971 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:49,971 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:49,971 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:49,971 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:49,971 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:49,972 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:49,972 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:49,972 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:49,972 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:49,972 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:49,972 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:49,973 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:49,973 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:49,973 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:49,973 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:49,973 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:49,973 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:50,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:50 BoogieIcfgContainer [2019-11-23 23:32:50,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:50,028 INFO L168 Benchmark]: Toolchain (without parser) took 9622.01 ms. Allocated memory was 142.6 MB in the beginning and 354.4 MB in the end (delta: 211.8 MB). Free memory was 99.2 MB in the beginning and 135.8 MB in the end (delta: -36.6 MB). Peak memory consumption was 175.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:50,029 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:50,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.11 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 99.0 MB in the beginning and 164.5 MB in the end (delta: -65.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:50,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.53 ms. Allocated memory is still 200.3 MB. Free memory was 164.5 MB in the beginning and 158.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:50,033 INFO L168 Benchmark]: Boogie Preprocessor took 96.99 ms. Allocated memory is still 200.3 MB. Free memory was 158.6 MB in the beginning and 154.2 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:50,034 INFO L168 Benchmark]: RCFGBuilder took 1982.26 ms. Allocated memory was 200.3 MB in the beginning and 253.8 MB in the end (delta: 53.5 MB). Free memory was 154.2 MB in the beginning and 197.7 MB in the end (delta: -43.5 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:50,037 INFO L168 Benchmark]: TraceAbstraction took 6689.23 ms. Allocated memory was 253.8 MB in the beginning and 354.4 MB in the end (delta: 100.7 MB). Free memory was 197.7 MB in the beginning and 135.8 MB in the end (delta: 61.8 MB). Peak memory consumption was 162.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:50,049 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 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.11 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 99.0 MB in the beginning and 164.5 MB in the end (delta: -65.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 131.53 ms. Allocated memory is still 200.3 MB. Free memory was 164.5 MB in the beginning and 158.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.99 ms. Allocated memory is still 200.3 MB. Free memory was 158.6 MB in the beginning and 154.2 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1982.26 ms. Allocated memory was 200.3 MB in the beginning and 253.8 MB in the end (delta: 53.5 MB). Free memory was 154.2 MB in the beginning and 197.7 MB in the end (delta: -43.5 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6689.23 ms. Allocated memory was 253.8 MB in the beginning and 354.4 MB in the end (delta: 100.7 MB). Free memory was 197.7 MB in the beginning and 135.8 MB in the end (delta: 61.8 MB). Peak memory consumption was 162.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 457]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1) || ((a17 <= 7 && a28 == 7) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || (((a17 <= 7 && !(a25 == 1)) && a19 == 1) && a11 == 1)) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a17 == 8 && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1) || ((a17 <= 7 && a28 == 7) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || (((a17 <= 7 && !(a25 == 1)) && a19 == 1) && a11 == 1)) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a17 == 8 && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 589 SDtfs, 1009 SDslu, 71 SDs, 0 SdLazy, 2426 SolverSat, 645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 800 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 171 HoareAnnotationTreeSize, 3 FomulaSimplifications, 558 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 406 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1273 ConstructedInterpolants, 0 QuantifiedInterpolants, 316326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 859/862 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...