/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:04,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:04,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:04,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:04,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:04,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:04,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:04,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:04,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:04,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:04,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:04,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:04,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:04,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:04,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:04,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:04,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:04,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:04,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:04,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:04,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:04,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:04,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:04,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:04,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:04,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:04,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:04,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:04,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:04,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:04,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:04,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:04,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:04,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:04,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:04,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:04,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:04,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:04,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:04,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:04,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:04,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:32:04,323 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:04,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:04,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:04,325 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:04,325 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:04,325 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:04,325 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:04,326 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:04,326 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:04,326 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:04,326 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:04,326 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:04,327 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:04,327 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:04,327 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:04,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:04,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:04,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:04,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:04,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:04,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:04,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:04,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:04,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:04,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:04,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:04,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:04,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:04,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:04,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:04,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:04,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:04,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:04,331 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:04,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:04,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:04,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:04,332 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:04,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:04,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:04,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:04,608 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:04,608 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:04,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label09.c [2019-11-23 23:32:04,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052b627d1/13048904a1564bc29f64a5593ebc6777/FLAG58d52d8a6 [2019-11-23 23:32:05,220 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:05,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label09.c [2019-11-23 23:32:05,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052b627d1/13048904a1564bc29f64a5593ebc6777/FLAG58d52d8a6 [2019-11-23 23:32:05,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052b627d1/13048904a1564bc29f64a5593ebc6777 [2019-11-23 23:32:05,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:05,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:05,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:05,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:05,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:05,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:05" (1/1) ... [2019-11-23 23:32:05,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61850f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:05, skipping insertion in model container [2019-11-23 23:32:05,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:05" (1/1) ... [2019-11-23 23:32:05,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:05,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:06,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:06,078 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:06,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:06,237 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:06,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06 WrapperNode [2019-11-23 23:32:06,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:06,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:06,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:06,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:06,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:06,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:06,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:06,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:06,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... [2019-11-23 23:32:06,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:06,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:06,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:06,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:06,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:06,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:08,762 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:08,763 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:08,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:08 BoogieIcfgContainer [2019-11-23 23:32:08,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:08,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:08,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:08,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:08,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:05" (1/3) ... [2019-11-23 23:32:08,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2a6e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:08, skipping insertion in model container [2019-11-23 23:32:08,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:06" (2/3) ... [2019-11-23 23:32:08,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2a6e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:08, skipping insertion in model container [2019-11-23 23:32:08,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:08" (3/3) ... [2019-11-23 23:32:08,775 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label09.c [2019-11-23 23:32:08,785 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:08,793 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:08,805 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:08,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:08,843 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:08,843 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:08,843 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:08,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:08,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:08,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:08,845 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:08,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:08,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:08,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash 925958671, now seen corresponding path program 1 times [2019-11-23 23:32:08,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:08,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349719607] [2019-11-23 23:32:08,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:09,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349719607] [2019-11-23 23:32:09,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:09,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:09,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312294611] [2019-11-23 23:32:09,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:09,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:09,262 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:10,133 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:10,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:10,151 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:10,151 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:10,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2019-11-23 23:32:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-23 23:32:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2019-11-23 23:32:10,216 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2019-11-23 23:32:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:10,217 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2019-11-23 23:32:10,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2019-11-23 23:32:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:32:10,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:10,227 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:10,230 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1028679428, now seen corresponding path program 1 times [2019-11-23 23:32:10,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:10,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535111394] [2019-11-23 23:32:10,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:32:10,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535111394] [2019-11-23 23:32:10,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:10,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:10,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517222233] [2019-11-23 23:32:10,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:10,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:10,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:10,429 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand 3 states. [2019-11-23 23:32:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:10,830 INFO L93 Difference]: Finished difference Result 485 states and 891 transitions. [2019-11-23 23:32:10,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:10,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:32:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:10,834 INFO L225 Difference]: With dead ends: 485 [2019-11-23 23:32:10,834 INFO L226 Difference]: Without dead ends: 323 [2019-11-23 23:32:10,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-23 23:32:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-11-23 23:32:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 23:32:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 543 transitions. [2019-11-23 23:32:10,879 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 543 transitions. Word has length 84 [2019-11-23 23:32:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:10,880 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 543 transitions. [2019-11-23 23:32:10,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 543 transitions. [2019-11-23 23:32:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:32:10,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:10,884 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:10,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash 221759150, now seen corresponding path program 1 times [2019-11-23 23:32:10,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:10,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573805090] [2019-11-23 23:32:10,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:10,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573805090] [2019-11-23 23:32:10,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:10,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:10,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557246733] [2019-11-23 23:32:10,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:10,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:10,968 INFO L87 Difference]: Start difference. First operand 323 states and 543 transitions. Second operand 4 states. [2019-11-23 23:32:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:11,598 INFO L93 Difference]: Finished difference Result 1285 states and 2167 transitions. [2019-11-23 23:32:11,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:11,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:32:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:11,607 INFO L225 Difference]: With dead ends: 1285 [2019-11-23 23:32:11,607 INFO L226 Difference]: Without dead ends: 963 [2019-11-23 23:32:11,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-23 23:32:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 643. [2019-11-23 23:32:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-23 23:32:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1033 transitions. [2019-11-23 23:32:11,650 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1033 transitions. Word has length 98 [2019-11-23 23:32:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:11,650 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1033 transitions. [2019-11-23 23:32:11,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1033 transitions. [2019-11-23 23:32:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:32:11,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:11,655 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:11,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2142816694, now seen corresponding path program 1 times [2019-11-23 23:32:11,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:11,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801425277] [2019-11-23 23:32:11,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:11,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801425277] [2019-11-23 23:32:11,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:11,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:11,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957621387] [2019-11-23 23:32:11,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:11,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:11,716 INFO L87 Difference]: Start difference. First operand 643 states and 1033 transitions. Second operand 3 states. [2019-11-23 23:32:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:12,158 INFO L93 Difference]: Finished difference Result 1285 states and 2065 transitions. [2019-11-23 23:32:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:12,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-23 23:32:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:12,164 INFO L225 Difference]: With dead ends: 1285 [2019-11-23 23:32:12,164 INFO L226 Difference]: Without dead ends: 643 [2019-11-23 23:32:12,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-11-23 23:32:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-11-23 23:32:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-23 23:32:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 953 transitions. [2019-11-23 23:32:12,187 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 953 transitions. Word has length 113 [2019-11-23 23:32:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:12,188 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 953 transitions. [2019-11-23 23:32:12,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 953 transitions. [2019-11-23 23:32:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-23 23:32:12,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:12,192 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:12,192 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:12,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1587446250, now seen corresponding path program 1 times [2019-11-23 23:32:12,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:12,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533961546] [2019-11-23 23:32:12,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 23:32:12,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533961546] [2019-11-23 23:32:12,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:12,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:12,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486731790] [2019-11-23 23:32:12,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:12,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:12,257 INFO L87 Difference]: Start difference. First operand 643 states and 953 transitions. Second operand 4 states. [2019-11-23 23:32:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:12,964 INFO L93 Difference]: Finished difference Result 2085 states and 3046 transitions. [2019-11-23 23:32:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:12,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-23 23:32:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:12,975 INFO L225 Difference]: With dead ends: 2085 [2019-11-23 23:32:12,975 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:32:12,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:32:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2019-11-23 23:32:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-23 23:32:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1918 transitions. [2019-11-23 23:32:13,024 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1918 transitions. Word has length 128 [2019-11-23 23:32:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:13,025 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 1918 transitions. [2019-11-23 23:32:13,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1918 transitions. [2019-11-23 23:32:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 23:32:13,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:13,032 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:13,032 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash 500026422, now seen corresponding path program 1 times [2019-11-23 23:32:13,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:13,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029967706] [2019-11-23 23:32:13,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:13,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029967706] [2019-11-23 23:32:13,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:13,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:13,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110152369] [2019-11-23 23:32:13,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:13,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:13,146 INFO L87 Difference]: Start difference. First operand 1443 states and 1918 transitions. Second operand 3 states. [2019-11-23 23:32:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:13,559 INFO L93 Difference]: Finished difference Result 2885 states and 3835 transitions. [2019-11-23 23:32:13,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:13,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 23:32:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:13,570 INFO L225 Difference]: With dead ends: 2885 [2019-11-23 23:32:13,570 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:32:13,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:32:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1123. [2019-11-23 23:32:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1433 transitions. [2019-11-23 23:32:13,605 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1433 transitions. Word has length 155 [2019-11-23 23:32:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:13,606 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1433 transitions. [2019-11-23 23:32:13,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1433 transitions. [2019-11-23 23:32:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 23:32:13,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:13,610 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:13,610 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:13,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1409171176, now seen corresponding path program 1 times [2019-11-23 23:32:13,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:13,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706221006] [2019-11-23 23:32:13,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 23:32:13,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706221006] [2019-11-23 23:32:13,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:13,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:13,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553620679] [2019-11-23 23:32:13,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:13,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:13,695 INFO L87 Difference]: Start difference. First operand 1123 states and 1433 transitions. Second operand 3 states. [2019-11-23 23:32:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:14,103 INFO L93 Difference]: Finished difference Result 2723 states and 3434 transitions. [2019-11-23 23:32:14,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:14,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 23:32:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:14,103 INFO L225 Difference]: With dead ends: 2723 [2019-11-23 23:32:14,104 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:14,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:14,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2019-11-23 23:32:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:14,108 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:14,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:14,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:14,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:14,364 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-11-23 23:32:14,501 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-11-23 23:32:14,504 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:14,505 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:14,506 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:14,507 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:14,508 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:14,510 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 535) no Hoare annotation was computed. [2019-11-23 23:32:14,510 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:14,510 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:14,510 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:14,510 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:14,511 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a25~0 1))) (let ((.cse2 (= ~a28~0 9)) (.cse4 (not .cse7)) (.cse0 (= ~a19~0 1)) (.cse6 (not .cse3)) (.cse5 (= ~a17~0 8)) (.cse1 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse4 .cse3 .cse1) (and .cse4 .cse5 .cse6) (and .cse2 .cse4 .cse6) (and .cse4 .cse0 .cse3) (and .cse0 .cse7 .cse6) (and .cse5 .cse1)))) [2019-11-23 23:32:14,511 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:14,511 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:14,511 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:14,511 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:14,512 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:14,512 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:14,512 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-23 23:32:14,512 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:14,512 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:14,512 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:14,512 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:14,513 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:14,513 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:14,513 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a25~0 1))) (let ((.cse2 (= ~a28~0 9)) (.cse4 (not .cse7)) (.cse0 (= ~a19~0 1)) (.cse6 (not .cse3)) (.cse5 (= ~a17~0 8)) (.cse1 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse4 .cse3 .cse1) (and .cse4 .cse5 .cse6) (and .cse2 .cse4 .cse6) (and .cse4 .cse0 .cse3) (and .cse0 .cse7 .cse6) (and .cse5 .cse1)))) [2019-11-23 23:32:14,513 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:14,513 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:14,513 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:14,513 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:14,514 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:14,515 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:14,516 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:14,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:14 BoogieIcfgContainer [2019-11-23 23:32:14,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:14,538 INFO L168 Benchmark]: Toolchain (without parser) took 9017.07 ms. Allocated memory was 140.5 MB in the beginning and 329.8 MB in the end (delta: 189.3 MB). Free memory was 100.3 MB in the beginning and 200.1 MB in the end (delta: -99.8 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:14,539 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:14,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.36 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.1 MB in the beginning and 168.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:14,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.72 ms. Allocated memory is still 203.9 MB. Free memory was 168.0 MB in the beginning and 162.4 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:32:14,542 INFO L168 Benchmark]: Boogie Preprocessor took 96.50 ms. Allocated memory is still 203.9 MB. Free memory was 162.4 MB in the beginning and 158.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:14,542 INFO L168 Benchmark]: RCFGBuilder took 2338.74 ms. Allocated memory was 203.9 MB in the beginning and 249.6 MB in the end (delta: 45.6 MB). Free memory was 156.3 MB in the beginning and 191.6 MB in the end (delta: -35.3 MB). Peak memory consumption was 111.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:14,543 INFO L168 Benchmark]: TraceAbstraction took 5770.79 ms. Allocated memory was 249.6 MB in the beginning and 329.8 MB in the end (delta: 80.2 MB). Free memory was 191.6 MB in the beginning and 200.1 MB in the end (delta: -8.5 MB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:14,548 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.28 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.36 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.1 MB in the beginning and 168.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.72 ms. Allocated memory is still 203.9 MB. Free memory was 168.0 MB in the beginning and 162.4 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.50 ms. Allocated memory is still 203.9 MB. Free memory was 162.4 MB in the beginning and 158.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2338.74 ms. Allocated memory was 203.9 MB in the beginning and 249.6 MB in the end (delta: 45.6 MB). Free memory was 156.3 MB in the beginning and 191.6 MB in the end (delta: -35.3 MB). Peak memory consumption was 111.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5770.79 ms. Allocated memory was 249.6 MB in the beginning and 329.8 MB in the end (delta: 80.2 MB). Free memory was 191.6 MB in the beginning and 200.1 MB in the end (delta: -8.5 MB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((a19 == 1 && !(a28 == 11)) || (a28 == 9 && a11 == 1)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a17 == 8) && !(a11 == 1))) || ((a28 == 9 && !(a25 == 1)) && !(a11 == 1))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) || ((a19 == 1 && a25 == 1) && !(a11 == 1))) || (a17 == 8 && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((a19 == 1 && !(a28 == 11)) || (a28 == 9 && a11 == 1)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a17 == 8) && !(a11 == 1))) || ((a28 == 9 && !(a25 == 1)) && !(a11 == 1))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) || ((a19 == 1 && a25 == 1) && !(a11 == 1))) || (a17 == 8 && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 7, TraceHistogramMax: 5, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 452 SDtfs, 723 SDslu, 88 SDs, 0 SdLazy, 2318 SolverSat, 602 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 720 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 165 HoareAnnotationTreeSize, 3 FomulaSimplifications, 756 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 358 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 164695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 350/350 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...