/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_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:12,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:12,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:12,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:12,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:12,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:12,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:12,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:12,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:12,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:12,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:12,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:12,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:12,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:12,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:12,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:12,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:12,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:12,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:12,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:12,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:12,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:12,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:12,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:12,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:12,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:12,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:12,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:12,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:12,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:12,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:12,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:12,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:12,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:12,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:12,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:12,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:12,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:12,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:12,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:12,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:12,190 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:31:12,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:12,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:12,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:12,217 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:12,217 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:12,217 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:12,217 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:12,218 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:12,218 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:12,218 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:12,218 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:12,218 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:12,219 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:12,219 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:12,219 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:12,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:12,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:12,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:12,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:12,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:12,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:12,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:12,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:12,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:12,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:12,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:12,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:12,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:12,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:12,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:12,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:12,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:12,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:12,223 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:12,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:12,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:12,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:12,224 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:12,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:12,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:12,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:12,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:12,584 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:12,585 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label41.c [2019-11-23 23:31:12,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc13eca7/4c40d0de42a74ba99742248bce21e62b/FLAG70904d627 [2019-11-23 23:31:13,254 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:13,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label41.c [2019-11-23 23:31:13,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc13eca7/4c40d0de42a74ba99742248bce21e62b/FLAG70904d627 [2019-11-23 23:31:13,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc13eca7/4c40d0de42a74ba99742248bce21e62b [2019-11-23 23:31:13,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:13,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:13,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:13,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:13,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:13,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:13" (1/1) ... [2019-11-23 23:31:13,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127afcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:13, skipping insertion in model container [2019-11-23 23:31:13,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:13" (1/1) ... [2019-11-23 23:31:13,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:13,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:14,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:14,145 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:14,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:14,289 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:14,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14 WrapperNode [2019-11-23 23:31:14,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:14,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:14,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:14,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:14,299 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:31:14" (1/1) ... [2019-11-23 23:31:14,316 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:31:14" (1/1) ... [2019-11-23 23:31:14,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:14,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:14,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:14,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:14,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (1/1) ... [2019-11-23 23:31:14,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (1/1) ... [2019-11-23 23:31:14,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (1/1) ... [2019-11-23 23:31:14,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (1/1) ... [2019-11-23 23:31:14,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (1/1) ... [2019-11-23 23:31:14,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (1/1) ... [2019-11-23 23:31:14,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (1/1) ... [2019-11-23 23:31:14,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:14,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:14,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:14,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:14,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (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:31:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:14,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:16,532 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:16,532 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:16,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:16 BoogieIcfgContainer [2019-11-23 23:31:16,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:16,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:16,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:16,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:16,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:13" (1/3) ... [2019-11-23 23:31:16,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fef98e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:16, skipping insertion in model container [2019-11-23 23:31:16,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:14" (2/3) ... [2019-11-23 23:31:16,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fef98e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:16, skipping insertion in model container [2019-11-23 23:31:16,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:16" (3/3) ... [2019-11-23 23:31:16,542 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label41.c [2019-11-23 23:31:16,552 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:16,560 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:16,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:16,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:16,598 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:16,598 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:16,598 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:16,598 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:16,598 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:16,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:16,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:16,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:16,621 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:31:16,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1323246367, now seen corresponding path program 1 times [2019-11-23 23:31:16,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:16,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408909617] [2019-11-23 23:31:16,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:16,991 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:31:16,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408909617] [2019-11-23 23:31:16,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:16,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:16,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349080371] [2019-11-23 23:31:17,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:17,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:17,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:17,027 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:31:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:17,782 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:31:17,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:17,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:31:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:17,808 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:31:17,809 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:31:17,814 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:31:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:31:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:31:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:31:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:31:17,876 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:31:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:17,876 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:31:17,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:31:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:31:17,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:17,880 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:17,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:17,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1048398988, now seen corresponding path program 1 times [2019-11-23 23:31:17,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:17,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711172023] [2019-11-23 23:31:17,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:17,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711172023] [2019-11-23 23:31:17,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:17,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:17,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965972491] [2019-11-23 23:31:17,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:17,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:17,948 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:31:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:18,538 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:31:18,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:18,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:31:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:18,548 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:31:18,548 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:18,552 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:31:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:31:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:31:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-23 23:31:18,617 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 77 [2019-11-23 23:31:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:18,617 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-23 23:31:18,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-23 23:31:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:31:18,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:18,626 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:18,626 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:18,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2123303660, now seen corresponding path program 1 times [2019-11-23 23:31:18,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:18,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743526326] [2019-11-23 23:31:18,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:18,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743526326] [2019-11-23 23:31:18,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:18,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:18,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386034500] [2019-11-23 23:31:18,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:18,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:18,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:18,819 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 3 states. [2019-11-23 23:31:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:19,260 INFO L93 Difference]: Finished difference Result 1141 states and 1889 transitions. [2019-11-23 23:31:19,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:19,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-23 23:31:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:19,267 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:31:19,267 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:31:19,270 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:31:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:31:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2019-11-23 23:31:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:31:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 838 transitions. [2019-11-23 23:31:19,297 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 838 transitions. Word has length 78 [2019-11-23 23:31:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:19,298 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 838 transitions. [2019-11-23 23:31:19,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 838 transitions. [2019-11-23 23:31:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 23:31:19,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:19,301 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:19,301 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:19,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:19,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1088772862, now seen corresponding path program 1 times [2019-11-23 23:31:19,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:19,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040780445] [2019-11-23 23:31:19,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:19,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040780445] [2019-11-23 23:31:19,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:19,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:19,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699122330] [2019-11-23 23:31:19,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:19,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:19,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:19,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:19,360 INFO L87 Difference]: Start difference. First operand 571 states and 838 transitions. Second operand 3 states. [2019-11-23 23:31:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:19,789 INFO L93 Difference]: Finished difference Result 1496 states and 2219 transitions. [2019-11-23 23:31:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:19,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-23 23:31:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:19,794 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 23:31:19,794 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:31:19,796 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:31:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:31:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-23 23:31:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 977 transitions. [2019-11-23 23:31:19,824 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 977 transitions. Word has length 86 [2019-11-23 23:31:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:19,824 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 977 transitions. [2019-11-23 23:31:19,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 977 transitions. [2019-11-23 23:31:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 23:31:19,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:19,828 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-23 23:31:19,828 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1624305646, now seen corresponding path program 1 times [2019-11-23 23:31:19,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:19,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387636096] [2019-11-23 23:31:19,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:31:19,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387636096] [2019-11-23 23:31:19,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:19,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:20,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134360031] [2019-11-23 23:31:20,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:20,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:20,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:20,002 INFO L87 Difference]: Start difference. First operand 784 states and 977 transitions. Second operand 4 states. [2019-11-23 23:31:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:20,427 INFO L93 Difference]: Finished difference Result 1658 states and 2055 transitions. [2019-11-23 23:31:20,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:20,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-23 23:31:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:20,433 INFO L225 Difference]: With dead ends: 1658 [2019-11-23 23:31:20,433 INFO L226 Difference]: Without dead ends: 875 [2019-11-23 23:31:20,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-11-23 23:31:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 855. [2019-11-23 23:31:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1051 transitions. [2019-11-23 23:31:20,460 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1051 transitions. Word has length 94 [2019-11-23 23:31:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:20,460 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1051 transitions. [2019-11-23 23:31:20,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1051 transitions. [2019-11-23 23:31:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:31:20,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:20,463 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:20,463 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash -161617226, now seen corresponding path program 1 times [2019-11-23 23:31:20,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:20,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344782537] [2019-11-23 23:31:20,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:20,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344782537] [2019-11-23 23:31:20,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:20,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:20,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884129215] [2019-11-23 23:31:20,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:20,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:20,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:20,550 INFO L87 Difference]: Start difference. First operand 855 states and 1051 transitions. Second operand 4 states. [2019-11-23 23:31:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:21,044 INFO L93 Difference]: Finished difference Result 1993 states and 2503 transitions. [2019-11-23 23:31:21,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:21,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:31:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:21,050 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:31:21,050 INFO L226 Difference]: Without dead ends: 1210 [2019-11-23 23:31:21,051 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:31:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-23 23:31:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 855. [2019-11-23 23:31:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1024 transitions. [2019-11-23 23:31:21,071 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1024 transitions. Word has length 98 [2019-11-23 23:31:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:21,072 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1024 transitions. [2019-11-23 23:31:21,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1024 transitions. [2019-11-23 23:31:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:31:21,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:21,075 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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:31:21,075 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2114885888, now seen corresponding path program 1 times [2019-11-23 23:31:21,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:21,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984969086] [2019-11-23 23:31:21,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:31:21,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984969086] [2019-11-23 23:31:21,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:21,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:31:21,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004815850] [2019-11-23 23:31:21,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:31:21,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:31:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:21,252 INFO L87 Difference]: Start difference. First operand 855 states and 1024 transitions. Second operand 8 states. [2019-11-23 23:31:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:22,079 INFO L93 Difference]: Finished difference Result 1890 states and 2264 transitions. [2019-11-23 23:31:22,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:31:22,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-11-23 23:31:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:22,087 INFO L225 Difference]: With dead ends: 1890 [2019-11-23 23:31:22,087 INFO L226 Difference]: Without dead ends: 1107 [2019-11-23 23:31:22,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-23 23:31:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 926. [2019-11-23 23:31:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:31:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1096 transitions. [2019-11-23 23:31:22,114 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1096 transitions. Word has length 158 [2019-11-23 23:31:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:22,114 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1096 transitions. [2019-11-23 23:31:22,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:31:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1096 transitions. [2019-11-23 23:31:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 23:31:22,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:22,119 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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:31:22,119 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1219957411, now seen corresponding path program 1 times [2019-11-23 23:31:22,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:22,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285329735] [2019-11-23 23:31:22,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-23 23:31:22,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285329735] [2019-11-23 23:31:22,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949395716] [2019-11-23 23:31:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:22,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:22,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-23 23:31:22,515 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-23 23:31:22,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:22,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 4 [2019-11-23 23:31:22,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207758616] [2019-11-23 23:31:22,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:22,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:22,567 INFO L87 Difference]: Start difference. First operand 926 states and 1096 transitions. Second operand 3 states. [2019-11-23 23:31:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:22,899 INFO L93 Difference]: Finished difference Result 1920 states and 2286 transitions. [2019-11-23 23:31:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:22,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 23:31:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:22,900 INFO L225 Difference]: With dead ends: 1920 [2019-11-23 23:31:22,900 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:22,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:22,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2019-11-23 23:31:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:22,904 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:22,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:22,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:23,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:23,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:23,237 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 69 [2019-11-23 23:31:23,591 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 28 [2019-11-23 23:31:23,843 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 28 [2019-11-23 23:31:23,848 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:23,848 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:23,848 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:23,848 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:23,848 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:23,849 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:23,849 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:23,849 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:23,849 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:23,849 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:23,849 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:23,850 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:23,850 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:23,851 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:23,851 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:23,852 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:23,852 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:23,852 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 1)) (.cse3 (not (= 13 ~a8~0))) (.cse4 (<= ~a17~0 0))) (or (= 1 ~a7~0) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse4 .cse3) (and .cse2 .cse3 (= ~a16~0 5)) (and (not (= ~a16~0 6)) .cse4))) [2019-11-23 23:31:23,853 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:23,853 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:23,854 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:23,854 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:23,854 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:23,855 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:23,855 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:23,857 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:23,857 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:23,858 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:23,858 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:23,858 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:23,858 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:23,858 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:23,859 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:23,859 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:23,859 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:23,859 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:23,859 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:23,859 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:23,860 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:23,860 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:23,860 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:23,864 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 1)) (.cse3 (not (= 13 ~a8~0))) (.cse4 (<= ~a17~0 0))) (or (= 1 ~a7~0) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse4 .cse3) (and .cse2 .cse3 (= ~a16~0 5)) (and (not (= ~a16~0 6)) .cse4))) [2019-11-23 23:31:23,865 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:23,865 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:23,865 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:23,865 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:23,871 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:23,871 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:23,871 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:23,871 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:23,872 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:23,872 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:23,872 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:23,872 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:23,872 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:23,872 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:23,878 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:23,878 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:23,878 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:23,878 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:23,879 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:23,879 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:23,879 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:23,879 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:23,879 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:23,880 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:23,880 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 431) no Hoare annotation was computed. [2019-11-23 23:31:23,880 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:23,880 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:23,880 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:23,881 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:23,883 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:23,883 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 23:31:23,883 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:23,883 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:23,884 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:23,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:23 BoogieIcfgContainer [2019-11-23 23:31:23,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:23,925 INFO L168 Benchmark]: Toolchain (without parser) took 10428.21 ms. Allocated memory was 145.8 MB in the beginning and 374.9 MB in the end (delta: 229.1 MB). Free memory was 101.7 MB in the beginning and 187.5 MB in the end (delta: -85.7 MB). Peak memory consumption was 143.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:23,927 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:23,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.75 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.5 MB in the beginning and 170.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:23,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.81 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 165.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:23,935 INFO L168 Benchmark]: Boogie Preprocessor took 62.63 ms. Allocated memory is still 204.5 MB. Free memory was 165.0 MB in the beginning and 160.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:23,936 INFO L168 Benchmark]: RCFGBuilder took 2084.50 ms. Allocated memory was 204.5 MB in the beginning and 249.6 MB in the end (delta: 45.1 MB). Free memory was 160.2 MB in the beginning and 205.0 MB in the end (delta: -44.8 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:23,940 INFO L168 Benchmark]: TraceAbstraction took 7385.02 ms. Allocated memory was 249.6 MB in the beginning and 374.9 MB in the end (delta: 125.3 MB). Free memory was 205.0 MB in the beginning and 187.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 142.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:23,952 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 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.75 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.5 MB in the beginning and 170.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 95.81 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 165.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.63 ms. Allocated memory is still 204.5 MB. Free memory was 165.0 MB in the beginning and 160.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2084.50 ms. Allocated memory was 204.5 MB in the beginning and 249.6 MB in the end (delta: 45.1 MB). Free memory was 160.2 MB in the beginning and 205.0 MB in the end (delta: -44.8 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7385.02 ms. Allocated memory was 249.6 MB in the beginning and 374.9 MB in the end (delta: 125.3 MB). Free memory was 205.0 MB in the beginning and 187.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 142.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 431]: 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: ((((1 == a7 || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || (a17 <= 0 && !(13 == a8))) || ((a20 == 1 && !(13 == a8)) && a16 == 5)) || (!(a16 == 6) && a17 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((1 == a7 || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || (a17 <= 0 && !(13 == a8))) || ((a20 == 1 && !(13 == a8)) && a16 == 5)) || (!(a16 == 6) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.2s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 405 SDtfs, 1055 SDslu, 71 SDs, 0 SdLazy, 2520 SolverSat, 636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 769 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 105 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3397 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2614 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1012 NumberOfCodeBlocks, 1012 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 421696 SizeOfPredicates, 1 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 682/686 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...