/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_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:33,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:33,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:33,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:33,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:33,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:33,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:33,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:33,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:33,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:33,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:33,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:33,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:33,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:33,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:33,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:33,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:33,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:33,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:33,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:33,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:33,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:33,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:33,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:33,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:33,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:33,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:33,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:33,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:33,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:33,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:33,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:33,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:33,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:33,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:33,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:33,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:33,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:33,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:33,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:33,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:33,261 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:33,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:33,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:33,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:33,286 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:33,286 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:33,286 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:33,287 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:33,287 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:33,287 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:33,287 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:33,288 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:33,289 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:33,289 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:33,289 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:33,289 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:33,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:33,290 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:33,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:33,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:33,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:33,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:33,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:33,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:33,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:33,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:33,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:33,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:33,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:33,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:33,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:33,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:33,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:33,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:33,295 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:33,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:33,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:33,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:33,296 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:33,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:33,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:33,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:33,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:33,583 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:33,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label04.c [2019-11-23 23:29:33,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389c9d8c0/b05ae59314754dd39d7c0aeaef1efdd3/FLAG332932b13 [2019-11-23 23:29:34,204 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:34,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label04.c [2019-11-23 23:29:34,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389c9d8c0/b05ae59314754dd39d7c0aeaef1efdd3/FLAG332932b13 [2019-11-23 23:29:34,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389c9d8c0/b05ae59314754dd39d7c0aeaef1efdd3 [2019-11-23 23:29:34,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:34,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:34,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:34,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:34,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:34,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:34" (1/1) ... [2019-11-23 23:29:34,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eaa97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34, skipping insertion in model container [2019-11-23 23:29:34,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:34" (1/1) ... [2019-11-23 23:29:34,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:34,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:35,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:35,097 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:35,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:35,248 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:35,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:35 WrapperNode [2019-11-23 23:29:35,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:35,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:35,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:35,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:35,262 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:35" (1/1) ... [2019-11-23 23:29:35,304 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:35" (1/1) ... [2019-11-23 23:29:35,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:35,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:35,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:35,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:35,413 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:35" (1/1) ... [2019-11-23 23:29:35,413 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:35" (1/1) ... [2019-11-23 23:29:35,428 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:35" (1/1) ... [2019-11-23 23:29:35,430 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:35" (1/1) ... [2019-11-23 23:29:35,461 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:35" (1/1) ... [2019-11-23 23:29:35,476 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:35" (1/1) ... [2019-11-23 23:29:35,488 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:35" (1/1) ... [2019-11-23 23:29:35,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:35,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:35,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:35,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:35,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:35" (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:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:35,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:37,442 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:37,443 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:37,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:37 BoogieIcfgContainer [2019-11-23 23:29:37,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:37,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:37,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:37,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:37,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:34" (1/3) ... [2019-11-23 23:29:37,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a346fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:37, skipping insertion in model container [2019-11-23 23:29:37,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:35" (2/3) ... [2019-11-23 23:29:37,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a346fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:37, skipping insertion in model container [2019-11-23 23:29:37,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:37" (3/3) ... [2019-11-23 23:29:37,453 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label04.c [2019-11-23 23:29:37,463 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:37,471 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:37,482 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:37,515 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:37,516 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:37,516 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:37,516 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:37,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:37,516 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:37,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:37,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:37,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:37,548 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:37,549 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1323243551, now seen corresponding path program 1 times [2019-11-23 23:29:37,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:37,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695275790] [2019-11-23 23:29:37,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:38,033 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:38,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695275790] [2019-11-23 23:29:38,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:38,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:38,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47445513] [2019-11-23 23:29:38,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:38,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:38,061 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:29:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:38,891 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:29:38,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:38,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:29:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:38,918 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:29:38,919 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:29:38,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:29:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:29:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:29:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-23 23:29:39,016 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-23 23:29:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:39,017 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-23 23:29:39,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-23 23:29:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:29:39,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:39,022 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:39,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:39,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash 585774169, now seen corresponding path program 1 times [2019-11-23 23:29:39,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:39,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072957805] [2019-11-23 23:29:39,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:39,105 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:39,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072957805] [2019-11-23 23:29:39,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:39,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:39,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982903019] [2019-11-23 23:29:39,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:39,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:39,110 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-23 23:29:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:39,620 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-23 23:29:39,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:39,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:29:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:39,623 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:29:39,623 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:39,626 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:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-23 23:29:39,651 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-23 23:29:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:39,651 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-23 23:29:39,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-23 23:29:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:29:39,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:39,663 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:39,664 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:39,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash 928581475, now seen corresponding path program 1 times [2019-11-23 23:29:39,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:39,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479876193] [2019-11-23 23:29:39,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:39,773 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:39,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479876193] [2019-11-23 23:29:39,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:39,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:39,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311186796] [2019-11-23 23:29:39,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:39,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:39,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:39,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:39,776 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-23 23:29:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:40,154 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-23 23:29:40,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:40,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:29:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:40,159 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:29:40,160 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:29:40,161 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:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:29:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-23 23:29:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:29:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-23 23:29:40,190 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-23 23:29:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:40,191 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-23 23:29:40,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-23 23:29:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:29:40,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:40,195 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:40,196 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:40,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1330802810, now seen corresponding path program 1 times [2019-11-23 23:29:40,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:40,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934168555] [2019-11-23 23:29:40,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:40,292 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:40,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934168555] [2019-11-23 23:29:40,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:40,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:40,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565682182] [2019-11-23 23:29:40,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:40,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:40,295 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-23 23:29:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:40,688 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-23 23:29:40,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:40,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:29:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:40,693 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:29:40,693 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:40,695 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:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:29:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:29:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 967 transitions. [2019-11-23 23:29:40,713 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 967 transitions. Word has length 133 [2019-11-23 23:29:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:40,714 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 967 transitions. [2019-11-23 23:29:40,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 967 transitions. [2019-11-23 23:29:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 23:29:40,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:40,717 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:40,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash -211733482, now seen corresponding path program 1 times [2019-11-23 23:29:40,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:40,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107069778] [2019-11-23 23:29:40,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:40,785 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:40,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107069778] [2019-11-23 23:29:40,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695371228] [2019-11-23 23:29:40,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:40,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:40,789 INFO L87 Difference]: Start difference. First operand 642 states and 967 transitions. Second operand 3 states. [2019-11-23 23:29:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:41,210 INFO L93 Difference]: Finished difference Result 1709 states and 2563 transitions. [2019-11-23 23:29:41,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:41,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 23:29:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:41,219 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:29:41,220 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:29:41,222 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:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:29:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-23 23:29:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:29:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1269 transitions. [2019-11-23 23:29:41,256 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1269 transitions. Word has length 152 [2019-11-23 23:29:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:41,257 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1269 transitions. [2019-11-23 23:29:41,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1269 transitions. [2019-11-23 23:29:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 23:29:41,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:41,262 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:41,263 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1004826717, now seen corresponding path program 1 times [2019-11-23 23:29:41,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:41,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575271665] [2019-11-23 23:29:41,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:41,391 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:41,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575271665] [2019-11-23 23:29:41,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:41,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:41,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198812455] [2019-11-23 23:29:41,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:41,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:41,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:41,394 INFO L87 Difference]: Start difference. First operand 855 states and 1269 transitions. Second operand 3 states. [2019-11-23 23:29:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:41,723 INFO L93 Difference]: Finished difference Result 1851 states and 2733 transitions. [2019-11-23 23:29:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:41,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 23:29:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:41,728 INFO L225 Difference]: With dead ends: 1851 [2019-11-23 23:29:41,728 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:29:41,730 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:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:29:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:29:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1429 transitions. [2019-11-23 23:29:41,760 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1429 transitions. Word has length 155 [2019-11-23 23:29:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:41,763 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1429 transitions. [2019-11-23 23:29:41,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1429 transitions. [2019-11-23 23:29:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 23:29:41,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:41,769 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:41,769 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:41,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1683953003, now seen corresponding path program 1 times [2019-11-23 23:29:41,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:41,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596175681] [2019-11-23 23:29:41,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:42,040 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:42,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596175681] [2019-11-23 23:29:42,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:42,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:29:42,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715888015] [2019-11-23 23:29:42,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:29:42,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:29:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:42,043 INFO L87 Difference]: Start difference. First operand 997 states and 1429 transitions. Second operand 8 states. [2019-11-23 23:29:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:42,787 INFO L93 Difference]: Finished difference Result 2100 states and 2970 transitions. [2019-11-23 23:29:42,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:29:42,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 23:29:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:42,793 INFO L225 Difference]: With dead ends: 2100 [2019-11-23 23:29:42,793 INFO L226 Difference]: Without dead ends: 1104 [2019-11-23 23:29:42,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-11-23 23:29:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-11-23 23:29:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1417 transitions. [2019-11-23 23:29:42,827 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1417 transitions. Word has length 159 [2019-11-23 23:29:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:42,828 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1417 transitions. [2019-11-23 23:29:42,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:29:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1417 transitions. [2019-11-23 23:29:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 23:29:42,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:42,834 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:42,834 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash -114232187, now seen corresponding path program 1 times [2019-11-23 23:29:42,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:42,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820550201] [2019-11-23 23:29:42,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:43,025 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:43,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820550201] [2019-11-23 23:29:43,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:43,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:43,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543219585] [2019-11-23 23:29:43,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:43,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:43,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:43,028 INFO L87 Difference]: Start difference. First operand 997 states and 1417 transitions. Second operand 4 states. [2019-11-23 23:29:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:43,637 INFO L93 Difference]: Finished difference Result 2135 states and 3035 transitions. [2019-11-23 23:29:43,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:43,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-23 23:29:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:43,645 INFO L225 Difference]: With dead ends: 2135 [2019-11-23 23:29:43,645 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:29:43,647 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:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:29:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-23 23:29:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1422 transitions. [2019-11-23 23:29:43,671 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1422 transitions. Word has length 192 [2019-11-23 23:29:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:43,672 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1422 transitions. [2019-11-23 23:29:43,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1422 transitions. [2019-11-23 23:29:43,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 23:29:43,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:43,677 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:43,677 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1171743545, now seen corresponding path program 1 times [2019-11-23 23:29:43,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:43,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910066660] [2019-11-23 23:29:43,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:43,803 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:43,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910066660] [2019-11-23 23:29:43,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:43,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:43,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703663815] [2019-11-23 23:29:43,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:43,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:43,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:43,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:43,811 INFO L87 Difference]: Start difference. First operand 1068 states and 1422 transitions. Second operand 4 states. [2019-11-23 23:29:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:44,280 INFO L93 Difference]: Finished difference Result 2419 states and 3181 transitions. [2019-11-23 23:29:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:44,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-23 23:29:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:44,288 INFO L225 Difference]: With dead ends: 2419 [2019-11-23 23:29:44,288 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:29:44,290 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:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:29:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-23 23:29:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:29:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1410 transitions. [2019-11-23 23:29:44,315 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1410 transitions. Word has length 218 [2019-11-23 23:29:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:44,316 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1410 transitions. [2019-11-23 23:29:44,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1410 transitions. [2019-11-23 23:29:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 23:29:44,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:44,321 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:44,321 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash 39383556, now seen corresponding path program 1 times [2019-11-23 23:29:44,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:44,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851576205] [2019-11-23 23:29:44,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:44,476 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:44,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851576205] [2019-11-23 23:29:44,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:44,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:29:44,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492509450] [2019-11-23 23:29:44,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:29:44,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:44,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:29:44,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:29:44,478 INFO L87 Difference]: Start difference. First operand 1068 states and 1410 transitions. Second operand 6 states. [2019-11-23 23:29:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:45,100 INFO L93 Difference]: Finished difference Result 2244 states and 2934 transitions. [2019-11-23 23:29:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:29:45,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-23 23:29:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:45,109 INFO L225 Difference]: With dead ends: 2244 [2019-11-23 23:29:45,109 INFO L226 Difference]: Without dead ends: 1177 [2019-11-23 23:29:45,111 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:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-11-23 23:29:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-11-23 23:29:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:29:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-11-23 23:29:45,139 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 239 [2019-11-23 23:29:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:45,140 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-11-23 23:29:45,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:29:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-11-23 23:29:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-23 23:29:45,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:45,144 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:45,145 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1839443035, now seen corresponding path program 1 times [2019-11-23 23:29:45,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:45,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930343600] [2019-11-23 23:29:45,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:46,209 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:46,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930343600] [2019-11-23 23:29:46,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:46,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 23:29:46,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133080776] [2019-11-23 23:29:46,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 23:29:46,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 23:29:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-23 23:29:46,211 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 14 states. [2019-11-23 23:29:47,718 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-11-23 23:29:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:47,853 INFO L93 Difference]: Finished difference Result 2252 states and 2825 transitions. [2019-11-23 23:29:47,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 23:29:47,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-11-23 23:29:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:47,855 INFO L225 Difference]: With dead ends: 2252 [2019-11-23 23:29:47,855 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:29:47,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2019-11-23 23:29:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:29:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:29:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:29:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:29:47,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-11-23 23:29:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:47,861 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:29:47,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 23:29:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:29:47,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:29:47,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:29:48,090 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 111 [2019-11-23 23:29:48,256 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 111 [2019-11-23 23:29:48,766 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-11-23 23:29:49,347 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-11-23 23:29:49,351 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:29:49,351 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:29:49,351 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:29:49,352 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:29:49,353 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:29:49,353 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:29:49,353 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:29:49,353 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:29:49,353 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:29:49,353 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:29:49,354 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)) (.cse6 (= ~a17~0 1)) (.cse8 (= ~a20~0 1)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8))) (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 .cse6 .cse0 .cse1 .cse8) (and .cse11 .cse0 .cse1 (= 15 ~a8~0) .cse9)))) [2019-11-23 23:29:49,354 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:29:49,354 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:29:49,355 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:29:49,355 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:29:49,355 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:29:49,355 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:29:49,355 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:29:49,355 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:29:49,355 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:29:49,356 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:29:49,357 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:29:49,357 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:29:49,357 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:29:49,357 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:29:49,357 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:29:49,357 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:29:49,357 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)) (.cse6 (= ~a17~0 1)) (.cse8 (= ~a20~0 1)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8))) (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 .cse6 .cse0 .cse1 .cse8) (and .cse11 .cse0 .cse1 (= 15 ~a8~0) .cse9)))) [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:29:49,358 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:29:49,359 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 464) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:29:49,360 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:29:49,361 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:29:49,361 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:29:49,361 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:29:49,361 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 23:29:49,361 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:29:49,361 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:29:49,361 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:29:49,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:49 BoogieIcfgContainer [2019-11-23 23:29:49,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:29:49,385 INFO L168 Benchmark]: Toolchain (without parser) took 14888.11 ms. Allocated memory was 147.3 MB in the beginning and 460.3 MB in the end (delta: 313.0 MB). Free memory was 103.6 MB in the beginning and 157.6 MB in the end (delta: -54.0 MB). Peak memory consumption was 259.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:49,386 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 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:29:49,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.71 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 103.4 MB in the beginning and 171.3 MB in the end (delta: -67.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:49,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.26 ms. Allocated memory is still 206.6 MB. Free memory was 171.3 MB in the beginning and 165.3 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:29:49,388 INFO L168 Benchmark]: Boogie Preprocessor took 107.21 ms. Allocated memory is still 206.6 MB. Free memory was 165.3 MB in the beginning and 160.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:49,389 INFO L168 Benchmark]: RCFGBuilder took 1935.72 ms. Allocated memory was 206.6 MB in the beginning and 246.4 MB in the end (delta: 39.8 MB). Free memory was 160.7 MB in the beginning and 190.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:49,390 INFO L168 Benchmark]: TraceAbstraction took 11938.27 ms. Allocated memory was 246.4 MB in the beginning and 460.3 MB in the end (delta: 213.9 MB). Free memory was 190.7 MB in the beginning and 157.6 MB in the end (delta: 33.1 MB). Peak memory consumption was 247.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:29:49,394 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.20 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.71 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 103.4 MB in the beginning and 171.3 MB in the end (delta: -67.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 151.26 ms. Allocated memory is still 206.6 MB. Free memory was 171.3 MB in the beginning and 165.3 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.21 ms. Allocated memory is still 206.6 MB. Free memory was 165.3 MB in the beginning and 160.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1935.72 ms. Allocated memory was 206.6 MB in the beginning and 246.4 MB in the end (delta: 39.8 MB). Free memory was 160.7 MB in the beginning and 190.7 MB in the end (delta: -30.0 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11938.27 ms. Allocated memory was 246.4 MB in the beginning and 460.3 MB in the end (delta: 213.9 MB). Free memory was 190.7 MB in the beginning and 157.6 MB in the end (delta: 33.1 MB). Peak memory consumption was 247.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 464]: 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)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(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)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 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.8s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 598 SDtfs, 1468 SDslu, 108 SDs, 0 SdLazy, 4618 SolverSat, 923 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred 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, 1068 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 299 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15492 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4924 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294486 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...