/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label01.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:15,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:15,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:15,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:15,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:15,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:15,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:15,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:15,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:15,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:15,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:15,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:15,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:15,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:15,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:15,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:15,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:15,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:15,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:15,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:15,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:15,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:15,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:15,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:15,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:15,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:15,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:15,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:15,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:15,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:15,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:15,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:15,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:15,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:15,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:15,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:15,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:15,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:15,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:15,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:15,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:15,295 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:29:15,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:15,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:15,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:15,322 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:15,322 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:15,323 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:15,323 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:15,323 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:15,323 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:15,323 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:15,324 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:15,325 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:15,325 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:15,325 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:15,326 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:15,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:15,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:15,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:15,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:15,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:15,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:15,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:15,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:15,328 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:15,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:15,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:15,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:15,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:15,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:15,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:15,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:15,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:15,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:15,331 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:15,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:15,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:15,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:15,332 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:15,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:15,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:15,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:15,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:15,622 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:15,623 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label01.c [2019-11-23 23:29:15,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8398d2093/177c80721c924cbe8f198d6c84f09748/FLAG212253a75 [2019-11-23 23:29:16,210 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:16,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label01.c [2019-11-23 23:29:16,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8398d2093/177c80721c924cbe8f198d6c84f09748/FLAG212253a75 [2019-11-23 23:29:16,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8398d2093/177c80721c924cbe8f198d6c84f09748 [2019-11-23 23:29:16,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:16,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:16,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:16,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:16,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:16,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:16" (1/1) ... [2019-11-23 23:29:16,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31dc77c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:16, skipping insertion in model container [2019-11-23 23:29:16,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:16" (1/1) ... [2019-11-23 23:29:16,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:16,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:17,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:17,086 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:17,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:17,279 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:17,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17 WrapperNode [2019-11-23 23:29:17,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:17,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:17,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:17,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:17,292 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:29:17" (1/1) ... [2019-11-23 23:29:17,326 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:29:17" (1/1) ... [2019-11-23 23:29:17,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:17,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:17,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:17,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:17,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2019-11-23 23:29:17,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2019-11-23 23:29:17,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2019-11-23 23:29:17,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2019-11-23 23:29:17,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2019-11-23 23:29:17,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2019-11-23 23:29:17,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (1/1) ... [2019-11-23 23:29:17,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:17,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:17,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:17,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:17,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (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:29:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:19,376 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:19,377 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:19,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:19 BoogieIcfgContainer [2019-11-23 23:29:19,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:19,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:19,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:19,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:19,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:16" (1/3) ... [2019-11-23 23:29:19,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532e1d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:19, skipping insertion in model container [2019-11-23 23:29:19,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:17" (2/3) ... [2019-11-23 23:29:19,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532e1d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:19, skipping insertion in model container [2019-11-23 23:29:19,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:19" (3/3) ... [2019-11-23 23:29:19,386 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label01.c [2019-11-23 23:29:19,396 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:19,403 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:19,414 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:19,439 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:19,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:19,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:19,440 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:19,440 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:19,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:19,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:19,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:19,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:19,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:19,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash -839569504, now seen corresponding path program 1 times [2019-11-23 23:29:19,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:19,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215090773] [2019-11-23 23:29:19,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:19,878 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:29:19,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215090773] [2019-11-23 23:29:19,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:19,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:19,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639881212] [2019-11-23 23:29:19,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:19,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:19,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:19,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:19,905 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:29:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:20,694 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:29:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:20,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:29:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:20,723 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:29:20,723 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:29:20,728 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:29:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:29:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:29:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:29:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-23 23:29:20,815 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-23 23:29:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:20,816 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-23 23:29:20,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-23 23:29:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:29:20,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:20,827 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:20,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:20,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash -523042310, now seen corresponding path program 1 times [2019-11-23 23:29:20,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:20,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277144515] [2019-11-23 23:29:20,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:29:20,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277144515] [2019-11-23 23:29:20,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:20,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:20,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684058143] [2019-11-23 23:29:20,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:20,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:20,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:20,914 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-23 23:29:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:21,343 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-23 23:29:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:21,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:29:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:21,347 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:29:21,347 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:21,349 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:29:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-23 23:29:21,371 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-23 23:29:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:21,371 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-23 23:29:21,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-23 23:29:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:29:21,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:21,374 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:29:21,374 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash 128044642, now seen corresponding path program 1 times [2019-11-23 23:29:21,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:21,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831339112] [2019-11-23 23:29:21,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:21,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831339112] [2019-11-23 23:29:21,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:21,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:21,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870508305] [2019-11-23 23:29:21,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:21,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:21,441 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-23 23:29:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:21,837 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-23 23:29:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:21,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:29:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:21,841 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:29:21,842 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:29:21,844 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:29:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:29:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-23 23:29:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:29:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-23 23:29:21,867 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-23 23:29:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:21,868 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-23 23:29:21,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-23 23:29:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:29:21,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:21,871 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:21,871 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1512537339, now seen corresponding path program 1 times [2019-11-23 23:29:21,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:21,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745334635] [2019-11-23 23:29:21,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 23:29:21,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745334635] [2019-11-23 23:29:21,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:21,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:21,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993067411] [2019-11-23 23:29:21,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:21,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:21,946 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-23 23:29:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:22,287 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-23 23:29:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:22,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:29:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:22,293 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:29:22,293 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:22,295 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:29:22,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:29:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:29:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 967 transitions. [2019-11-23 23:29:22,318 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 967 transitions. Word has length 133 [2019-11-23 23:29:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:22,319 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 967 transitions. [2019-11-23 23:29:22,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 967 transitions. [2019-11-23 23:29:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 23:29:22,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:22,322 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:22,322 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:22,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1158901705, now seen corresponding path program 1 times [2019-11-23 23:29:22,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:22,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046230295] [2019-11-23 23:29:22,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-23 23:29:22,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046230295] [2019-11-23 23:29:22,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:22,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:22,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834567419] [2019-11-23 23:29:22,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:22,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:22,425 INFO L87 Difference]: Start difference. First operand 642 states and 967 transitions. Second operand 3 states. [2019-11-23 23:29:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:22,868 INFO L93 Difference]: Finished difference Result 1709 states and 2563 transitions. [2019-11-23 23:29:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:22,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 23:29:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:22,881 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:29:22,881 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:29:22,882 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:29:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:29:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-23 23:29:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:29:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1353 transitions. [2019-11-23 23:29:22,923 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1353 transitions. Word has length 152 [2019-11-23 23:29:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:22,924 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1353 transitions. [2019-11-23 23:29:22,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1353 transitions. [2019-11-23 23:29:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 23:29:22,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:22,930 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:29:22,931 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1889561244, now seen corresponding path program 1 times [2019-11-23 23:29:22,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:22,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999048051] [2019-11-23 23:29:22,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:29:23,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999048051] [2019-11-23 23:29:23,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:23,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:23,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802232076] [2019-11-23 23:29:23,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:23,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:23,042 INFO L87 Difference]: Start difference. First operand 926 states and 1353 transitions. Second operand 3 states. [2019-11-23 23:29:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:23,397 INFO L93 Difference]: Finished difference Result 1993 states and 2901 transitions. [2019-11-23 23:29:23,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:23,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 23:29:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:23,404 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:29:23,405 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:29:23,406 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:29:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:29:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2019-11-23 23:29:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1507 transitions. [2019-11-23 23:29:23,447 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1507 transitions. Word has length 155 [2019-11-23 23:29:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:23,448 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1507 transitions. [2019-11-23 23:29:23,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1507 transitions. [2019-11-23 23:29:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 23:29:23,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:23,454 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:29:23,454 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:23,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:23,459 INFO L82 PathProgramCache]: Analyzing trace with hash 129838420, now seen corresponding path program 1 times [2019-11-23 23:29:23,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:23,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393844851] [2019-11-23 23:29:23,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:29:23,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393844851] [2019-11-23 23:29:23,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:23,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:29:23,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441479165] [2019-11-23 23:29:23,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:29:23,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:29:23,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:23,685 INFO L87 Difference]: Start difference. First operand 1068 states and 1507 transitions. Second operand 8 states. [2019-11-23 23:29:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:24,438 INFO L93 Difference]: Finished difference Result 2245 states and 3129 transitions. [2019-11-23 23:29:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:29:24,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 23:29:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:24,445 INFO L225 Difference]: With dead ends: 2245 [2019-11-23 23:29:24,445 INFO L226 Difference]: Without dead ends: 1178 [2019-11-23 23:29:24,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-23 23:29:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1068. [2019-11-23 23:29:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1495 transitions. [2019-11-23 23:29:24,474 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1495 transitions. Word has length 159 [2019-11-23 23:29:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:24,475 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1495 transitions. [2019-11-23 23:29:24,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:29:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1495 transitions. [2019-11-23 23:29:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 23:29:24,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:24,479 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:24,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:24,479 INFO L82 PathProgramCache]: Analyzing trace with hash -357770330, now seen corresponding path program 1 times [2019-11-23 23:29:24,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:24,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386247746] [2019-11-23 23:29:24,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:29:24,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386247746] [2019-11-23 23:29:24,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:24,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:24,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095733223] [2019-11-23 23:29:24,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:24,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:24,653 INFO L87 Difference]: Start difference. First operand 1068 states and 1495 transitions. Second operand 4 states. [2019-11-23 23:29:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:25,237 INFO L93 Difference]: Finished difference Result 2277 states and 3191 transitions. [2019-11-23 23:29:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:25,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-23 23:29:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:25,244 INFO L225 Difference]: With dead ends: 2277 [2019-11-23 23:29:25,244 INFO L226 Difference]: Without dead ends: 1210 [2019-11-23 23:29:25,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:29:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-23 23:29:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1139. [2019-11-23 23:29:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-23 23:29:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1500 transitions. [2019-11-23 23:29:25,272 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1500 transitions. Word has length 192 [2019-11-23 23:29:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:25,272 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1500 transitions. [2019-11-23 23:29:25,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1500 transitions. [2019-11-23 23:29:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 23:29:25,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:25,277 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:29:25,277 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 578253594, now seen corresponding path program 1 times [2019-11-23 23:29:25,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:25,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980574282] [2019-11-23 23:29:25,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 23:29:25,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980574282] [2019-11-23 23:29:25,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:25,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:25,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652240652] [2019-11-23 23:29:25,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:25,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:25,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:25,441 INFO L87 Difference]: Start difference. First operand 1139 states and 1500 transitions. Second operand 4 states. [2019-11-23 23:29:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:25,935 INFO L93 Difference]: Finished difference Result 2561 states and 3337 transitions. [2019-11-23 23:29:25,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:25,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-23 23:29:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:25,948 INFO L225 Difference]: With dead ends: 2561 [2019-11-23 23:29:25,949 INFO L226 Difference]: Without dead ends: 1423 [2019-11-23 23:29:25,951 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:29:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-11-23 23:29:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1068. [2019-11-23 23:29:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1410 transitions. [2019-11-23 23:29:25,975 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1410 transitions. Word has length 218 [2019-11-23 23:29:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:25,975 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1410 transitions. [2019-11-23 23:29:25,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1410 transitions. [2019-11-23 23:29:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 23:29:25,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:25,980 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-23 23:29:25,980 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash -136945981, now seen corresponding path program 1 times [2019-11-23 23:29:25,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:25,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773335019] [2019-11-23 23:29:25,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-23 23:29:26,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773335019] [2019-11-23 23:29:26,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:26,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:29:26,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312328429] [2019-11-23 23:29:26,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:29:26,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:26,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:29:26,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:29:26,160 INFO L87 Difference]: Start difference. First operand 1068 states and 1410 transitions. Second operand 6 states. [2019-11-23 23:29:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:26,772 INFO L93 Difference]: Finished difference Result 2244 states and 2934 transitions. [2019-11-23 23:29:26,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:29:26,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-23 23:29:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:26,783 INFO L225 Difference]: With dead ends: 2244 [2019-11-23 23:29:26,783 INFO L226 Difference]: Without dead ends: 1177 [2019-11-23 23:29:26,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:29:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-11-23 23:29:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-11-23 23:29:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-11-23 23:29:26,808 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 239 [2019-11-23 23:29:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:26,809 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-11-23 23:29:26,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:29:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-11-23 23:29:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-23 23:29:26,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:26,814 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:29:26,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1224232998, now seen corresponding path program 1 times [2019-11-23 23:29:26,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:26,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734715289] [2019-11-23 23:29:26,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-23 23:29:27,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734715289] [2019-11-23 23:29:27,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:27,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 23:29:27,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134646427] [2019-11-23 23:29:27,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 23:29:27,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:27,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 23:29:27,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-23 23:29:27,745 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 14 states. [2019-11-23 23:29:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:29,544 INFO L93 Difference]: Finished difference Result 2252 states and 2825 transitions. [2019-11-23 23:29:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 23:29:29,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-11-23 23:29:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:29,545 INFO L225 Difference]: With dead ends: 2252 [2019-11-23 23:29:29,546 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:29:29,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2019-11-23 23:29:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:29:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:29:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:29:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:29:29,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-11-23 23:29:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:29,550 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:29:29,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 23:29:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:29:29,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:29:29,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:29:29,670 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 118 [2019-11-23 23:29:29,792 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 119 [2019-11-23 23:29:30,432 WARN L192 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 56 [2019-11-23 23:29:31,086 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2019-11-23 23:29:31,091 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:29:31,091 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:29:31,091 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:29:31,091 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:29:31,092 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:29:31,092 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:29:31,092 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:29:31,092 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:29:31,092 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:29:31,093 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:29:31,094 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= 1 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse2 (not .cse1)) (.cse4 (= 13 ~a8~0)) (.cse7 (<= ~a17~0 0)) (.cse10 (= ~a16~0 4)) (.cse5 (not .cse9)) (.cse8 (= ~a20~0 1)) (.cse6 (= ~a17~0 1)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse12 (= 15 ~a8~0))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse2 .cse3 .cse4 .cse0 .cse7 .cse8 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse3 .cse4 .cse10 .cse0 .cse7) (and .cse10 .cse0 .cse1 (not .cse6)) (and .cse5 .cse11 .cse6 .cse0 .cse1) (and (or (and .cse11 .cse6 .cse1 .cse8) (and (or (and .cse1 .cse8 .cse12) (and .cse5 .cse1 .cse8)) .cse6)) .cse0) (and .cse11 .cse0 .cse1 .cse12 .cse9)))) [2019-11-23 23:29:31,094 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:29:31,094 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:29:31,096 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:29:31,096 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:29:31,096 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:29:31,096 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:29:31,096 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:29:31,097 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:29:31,097 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:29:31,097 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:31,097 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:29:31,097 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:29:31,097 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:29:31,097 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:29:31,097 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:29:31,098 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:29:31,099 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:29:31,099 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:29:31,099 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:29:31,099 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= 1 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse2 (not .cse1)) (.cse4 (= 13 ~a8~0)) (.cse7 (<= ~a17~0 0)) (.cse10 (= ~a16~0 4)) (.cse5 (not .cse9)) (.cse8 (= ~a20~0 1)) (.cse6 (= ~a17~0 1)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse12 (= 15 ~a8~0))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse2 .cse3 .cse4 .cse0 .cse7 .cse8 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse3 .cse4 .cse10 .cse0 .cse7) (and .cse10 .cse0 .cse1 (not .cse6)) (and .cse5 .cse11 .cse6 .cse0 .cse1) (and .cse0 (or (and .cse11 .cse6 .cse1 .cse8) (and (or (and .cse1 .cse8 .cse12) (and .cse5 .cse1 .cse8)) .cse6))) (and .cse11 .cse0 .cse1 .cse12 .cse9)))) [2019-11-23 23:29:31,099 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:29:31,099 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:29:31,099 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:29:31,100 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:29:31,101 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 449) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:29:31,102 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:29:31,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:31 BoogieIcfgContainer [2019-11-23 23:29:31,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:29:31,130 INFO L168 Benchmark]: Toolchain (without parser) took 14649.00 ms. Allocated memory was 142.6 MB in the beginning and 486.0 MB in the end (delta: 343.4 MB). Free memory was 100.9 MB in the beginning and 332.6 MB in the end (delta: -231.7 MB). Peak memory consumption was 300.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:31,131 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 142.6 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:29:31,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.07 ms. Allocated memory was 142.6 MB in the beginning and 206.6 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 172.2 MB in the end (delta: -71.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:31,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.58 ms. Allocated memory is still 206.6 MB. Free memory was 172.2 MB in the beginning and 166.6 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:31,133 INFO L168 Benchmark]: Boogie Preprocessor took 81.06 ms. Allocated memory is still 206.6 MB. Free memory was 166.6 MB in the beginning and 161.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:31,134 INFO L168 Benchmark]: RCFGBuilder took 1896.24 ms. Allocated memory was 206.6 MB in the beginning and 250.6 MB in the end (delta: 44.0 MB). Free memory was 161.7 MB in the beginning and 207.9 MB in the end (delta: -46.2 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:31,135 INFO L168 Benchmark]: TraceAbstraction took 11749.07 ms. Allocated memory was 250.6 MB in the beginning and 486.0 MB in the end (delta: 235.4 MB). Free memory was 206.1 MB in the beginning and 332.6 MB in the end (delta: -126.6 MB). Peak memory consumption was 297.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:31,140 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.27 ms. Allocated memory is still 142.6 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.07 ms. Allocated memory was 142.6 MB in the beginning and 206.6 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 172.2 MB in the end (delta: -71.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 119.58 ms. Allocated memory is still 206.6 MB. Free memory was 172.2 MB in the beginning and 166.6 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.06 ms. Allocated memory is still 206.6 MB. Free memory was 166.6 MB in the beginning and 161.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1896.24 ms. Allocated memory was 206.6 MB in the beginning and 250.6 MB in the end (delta: 44.0 MB). Free memory was 161.7 MB in the beginning and 207.9 MB in the end (delta: -46.2 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11749.07 ms. Allocated memory was 250.6 MB in the beginning and 486.0 MB in the end (delta: 235.4 MB). Free memory was 206.1 MB in the beginning and 332.6 MB in the end (delta: -126.6 MB). Peak memory consumption was 297.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 449]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((a12 == 8 && a21 == 1) && a16 == 5) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || (((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)) && a12 == 8)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((a12 == 8 && a21 == 1) && a16 == 5) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || (a12 == 8 && ((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)))) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 598 SDtfs, 1457 SDslu, 113 SDs, 0 SdLazy, 4907 SolverSat, 926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1071 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 363 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13166 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6384 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2252/2252 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...