/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_label30.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:53,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:53,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:53,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:53,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:53,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:53,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:53,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:53,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:53,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:53,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:53,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:53,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:53,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:53,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:53,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:53,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:53,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:53,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:53,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:53,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:53,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:53,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:53,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:53,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:53,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:53,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:53,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:53,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:53,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:53,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:53,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:53,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:53,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:53,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:53,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:53,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:53,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:53,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:53,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:53,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:53,251 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:30:53,264 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:53,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:53,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:53,266 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:53,266 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:53,266 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:53,266 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:53,267 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:53,267 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:53,267 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:53,267 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:53,267 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:53,268 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:53,268 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:53,268 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:53,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:53,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:53,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:53,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:53,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:53,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:53,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:53,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:53,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:53,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:53,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:53,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:53,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:53,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:53,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:53,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:53,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:53,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:53,272 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:53,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:53,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:53,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:53,273 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:53,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:53,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:53,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:53,560 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:53,560 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:53,561 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30.c [2019-11-23 23:30:53,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0294682f/a7931ea25a5b45318e1e10300b7c00fe/FLAG40405f131 [2019-11-23 23:30:54,301 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:54,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30.c [2019-11-23 23:30:54,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0294682f/a7931ea25a5b45318e1e10300b7c00fe/FLAG40405f131 [2019-11-23 23:30:54,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0294682f/a7931ea25a5b45318e1e10300b7c00fe [2019-11-23 23:30:54,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:54,545 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:54,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:54,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:54,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:54,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1feff869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54, skipping insertion in model container [2019-11-23 23:30:54,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:54,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:55,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:55,153 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:55,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:55,313 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:55,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55 WrapperNode [2019-11-23 23:30:55,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:55,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:55,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:55,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:55,324 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:30:55" (1/1) ... [2019-11-23 23:30:55,345 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:30:55" (1/1) ... [2019-11-23 23:30:55,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:55,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:55,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:55,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:55,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (1/1) ... [2019-11-23 23:30:55,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:55,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:55,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:55,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:55,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (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:30:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:55,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:57,554 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:57,554 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:57,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:57 BoogieIcfgContainer [2019-11-23 23:30:57,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:57,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:57,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:57,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:57,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:54" (1/3) ... [2019-11-23 23:30:57,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7928a540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:57, skipping insertion in model container [2019-11-23 23:30:57,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:55" (2/3) ... [2019-11-23 23:30:57,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7928a540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:57, skipping insertion in model container [2019-11-23 23:30:57,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:57" (3/3) ... [2019-11-23 23:30:57,565 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label30.c [2019-11-23 23:30:57,575 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:57,583 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:57,595 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:57,626 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:57,626 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:57,626 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:57,627 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:57,627 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:57,628 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:57,628 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:57,628 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:57,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:57,662 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:30:57,663 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1323230361, now seen corresponding path program 1 times [2019-11-23 23:30:57,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:57,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616280289] [2019-11-23 23:30:57,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:58,125 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:30:58,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616280289] [2019-11-23 23:30:58,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:58,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:58,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128762924] [2019-11-23 23:30:58,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:58,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:58,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:58,156 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:30:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:58,682 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:30:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:58,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:30:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:58,699 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:30:58,699 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:30:58,703 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:30:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:30:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:30:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 253 transitions. [2019-11-23 23:30:58,757 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 253 transitions. Word has length 71 [2019-11-23 23:30:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:58,758 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 253 transitions. [2019-11-23 23:30:58,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 253 transitions. [2019-11-23 23:30:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 23:30:58,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:58,762 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] [2019-11-23 23:30:58,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1129619871, now seen corresponding path program 1 times [2019-11-23 23:30:58,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:58,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353842909] [2019-11-23 23:30:58,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:58,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353842909] [2019-11-23 23:30:58,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:58,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:58,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610099129] [2019-11-23 23:30:58,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:58,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:58,882 INFO L87 Difference]: Start difference. First operand 145 states and 253 transitions. Second operand 3 states. [2019-11-23 23:30:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:59,365 INFO L93 Difference]: Finished difference Result 431 states and 756 transitions. [2019-11-23 23:30:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:59,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-23 23:30:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:59,372 INFO L225 Difference]: With dead ends: 431 [2019-11-23 23:30:59,373 INFO L226 Difference]: Without dead ends: 287 [2019-11-23 23:30:59,381 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:30:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-23 23:30:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-23 23:30:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:30:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2019-11-23 23:30:59,418 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 75 [2019-11-23 23:30:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:59,419 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2019-11-23 23:30:59,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2019-11-23 23:30:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 23:30:59,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:59,423 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:59,423 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:59,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:59,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2133666292, now seen corresponding path program 1 times [2019-11-23 23:30:59,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:59,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488847647] [2019-11-23 23:30:59,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:59,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488847647] [2019-11-23 23:30:59,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:59,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:59,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111292476] [2019-11-23 23:30:59,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:59,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:59,493 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand 3 states. [2019-11-23 23:30:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:59,843 INFO L93 Difference]: Finished difference Result 715 states and 1184 transitions. [2019-11-23 23:30:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:59,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 23:30:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:59,847 INFO L225 Difference]: With dead ends: 715 [2019-11-23 23:30:59,847 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:59,849 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:30:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-11-23 23:30:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-23 23:30:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-11-23 23:30:59,875 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 94 [2019-11-23 23:30:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:59,876 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-11-23 23:30:59,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-11-23 23:30:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:30:59,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:59,880 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:59,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:59,881 INFO L82 PathProgramCache]: Analyzing trace with hash 233197930, now seen corresponding path program 1 times [2019-11-23 23:30:59,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:59,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474078104] [2019-11-23 23:30:59,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 23:31:00,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474078104] [2019-11-23 23:31:00,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:00,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484970069] [2019-11-23 23:31:00,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:31:00,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:31:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:00,059 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 5 states. [2019-11-23 23:31:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:00,659 INFO L93 Difference]: Finished difference Result 788 states and 1270 transitions. [2019-11-23 23:31:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:00,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-23 23:31:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:00,662 INFO L225 Difference]: With dead ends: 788 [2019-11-23 23:31:00,663 INFO L226 Difference]: Without dead ends: 431 [2019-11-23 23:31:00,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-23 23:31:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2019-11-23 23:31:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:31:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 664 transitions. [2019-11-23 23:31:00,683 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 664 transitions. Word has length 98 [2019-11-23 23:31:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:00,683 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 664 transitions. [2019-11-23 23:31:00,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:31:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 664 transitions. [2019-11-23 23:31:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:31:00,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,687 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:00,687 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash -882333646, now seen corresponding path program 1 times [2019-11-23 23:31:00,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997361065] [2019-11-23 23:31:00,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:31:00,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997361065] [2019-11-23 23:31:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:00,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136284813] [2019-11-23 23:31:00,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:00,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:00,744 INFO L87 Difference]: Start difference. First operand 429 states and 664 transitions. Second operand 3 states. [2019-11-23 23:31:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:01,123 INFO L93 Difference]: Finished difference Result 928 states and 1464 transitions. [2019-11-23 23:31:01,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:01,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 23:31:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:01,127 INFO L225 Difference]: With dead ends: 928 [2019-11-23 23:31:01,127 INFO L226 Difference]: Without dead ends: 571 [2019-11-23 23:31:01,128 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:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-23 23:31:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-23 23:31:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:31:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 842 transitions. [2019-11-23 23:31:01,166 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 842 transitions. Word has length 102 [2019-11-23 23:31:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:01,166 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 842 transitions. [2019-11-23 23:31:01,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 842 transitions. [2019-11-23 23:31:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 23:31:01,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:01,169 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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:01,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:01,170 INFO L82 PathProgramCache]: Analyzing trace with hash 37920500, now seen corresponding path program 1 times [2019-11-23 23:31:01,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:01,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561671972] [2019-11-23 23:31:01,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:31:01,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561671972] [2019-11-23 23:31:01,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:01,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:01,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141649893] [2019-11-23 23:31:01,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:01,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:01,224 INFO L87 Difference]: Start difference. First operand 571 states and 842 transitions. Second operand 4 states. [2019-11-23 23:31:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:01,974 INFO L93 Difference]: Finished difference Result 1780 states and 2653 transitions. [2019-11-23 23:31:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:01,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-23 23:31:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:01,989 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:31:01,990 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:31:01,992 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:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:31:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 926. [2019-11-23 23:31:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:31:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1318 transitions. [2019-11-23 23:31:02,044 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1318 transitions. Word has length 111 [2019-11-23 23:31:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:02,044 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1318 transitions. [2019-11-23 23:31:02,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1318 transitions. [2019-11-23 23:31:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 23:31:02,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:02,050 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,050 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash 509282083, now seen corresponding path program 1 times [2019-11-23 23:31:02,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:02,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841012004] [2019-11-23 23:31:02,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:31:02,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841012004] [2019-11-23 23:31:02,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:02,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:02,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42166303] [2019-11-23 23:31:02,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:02,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:02,236 INFO L87 Difference]: Start difference. First operand 926 states and 1318 transitions. Second operand 4 states. [2019-11-23 23:31:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:02,961 INFO L93 Difference]: Finished difference Result 1780 states and 2558 transitions. [2019-11-23 23:31:02,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:02,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-23 23:31:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:02,969 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:31:02,969 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:31:02,971 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:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:31:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-23 23:31:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:31:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1312 transitions. [2019-11-23 23:31:03,006 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1312 transitions. Word has length 117 [2019-11-23 23:31:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:03,007 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1312 transitions. [2019-11-23 23:31:03,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1312 transitions. [2019-11-23 23:31:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:31:03,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:03,012 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:03,012 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1638328550, now seen corresponding path program 1 times [2019-11-23 23:31:03,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:03,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86585332] [2019-11-23 23:31:03,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-23 23:31:03,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86585332] [2019-11-23 23:31:03,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:03,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 23:31:03,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827580667] [2019-11-23 23:31:03,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:31:03,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:31:03,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:03,245 INFO L87 Difference]: Start difference. First operand 926 states and 1312 transitions. Second operand 6 states. [2019-11-23 23:31:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:04,253 INFO L93 Difference]: Finished difference Result 2067 states and 2917 transitions. [2019-11-23 23:31:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 23:31:04,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-23 23:31:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:04,263 INFO L225 Difference]: With dead ends: 2067 [2019-11-23 23:31:04,263 INFO L226 Difference]: Without dead ends: 1213 [2019-11-23 23:31:04,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-11-23 23:31:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2019-11-23 23:31:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:31:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1466 transitions. [2019-11-23 23:31:04,391 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1466 transitions. Word has length 131 [2019-11-23 23:31:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:04,393 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1466 transitions. [2019-11-23 23:31:04,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:31:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1466 transitions. [2019-11-23 23:31:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 23:31:04,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:04,399 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:04,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1291931105, now seen corresponding path program 1 times [2019-11-23 23:31:04,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:04,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051796168] [2019-11-23 23:31:04,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:31:04,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051796168] [2019-11-23 23:31:04,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:04,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:04,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452496336] [2019-11-23 23:31:04,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:04,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:04,531 INFO L87 Difference]: Start difference. First operand 1068 states and 1466 transitions. Second operand 4 states. [2019-11-23 23:31:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:05,281 INFO L93 Difference]: Finished difference Result 2845 states and 3883 transitions. [2019-11-23 23:31:05,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:05,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 23:31:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:05,292 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:31:05,292 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:31:05,296 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:31:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:31:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 997. [2019-11-23 23:31:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1162 transitions. [2019-11-23 23:31:05,328 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1162 transitions. Word has length 134 [2019-11-23 23:31:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:05,328 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1162 transitions. [2019-11-23 23:31:05,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1162 transitions. [2019-11-23 23:31:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 23:31:05,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:05,332 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:31:05,333 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:05,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:05,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2055486166, now seen corresponding path program 1 times [2019-11-23 23:31:05,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:05,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922709363] [2019-11-23 23:31:05,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 23:31:05,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922709363] [2019-11-23 23:31:05,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809332756] [2019-11-23 23:31:05,509 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:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:05,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:05,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:31:05,752 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:31:05,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:05,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:31:05,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341564358] [2019-11-23 23:31:05,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:05,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:05,824 INFO L87 Difference]: Start difference. First operand 997 states and 1162 transitions. Second operand 3 states. [2019-11-23 23:31:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:06,102 INFO L93 Difference]: Finished difference Result 1991 states and 2335 transitions. [2019-11-23 23:31:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:06,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 23:31:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:06,103 INFO L225 Difference]: With dead ends: 1991 [2019-11-23 23:31:06,104 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:06,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:06,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2019-11-23 23:31:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:06,108 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:06,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:06,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:06,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:06,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:06,588 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-23 23:31:06,749 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-11-23 23:31:06,752 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:06,753 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:06,754 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:06,756 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse7 (not (= 15 ~a8~0))) (.cse3 (= ~a20~0 1)) (.cse8 (not (= 1 ~a7~0))) (.cse5 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~a16~0 4))) (and .cse4 .cse5 .cse2) (and .cse6 .cse3) (and .cse7 .cse2 (= ~a16~0 5)) (and .cse1 .cse8 .cse0 .cse2) (and .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse0 .cse1) (and .cse7 .cse2 .cse3) (and .cse8 .cse5 .cse2))) [2019-11-23 23:31:06,756 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:06,756 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:06,757 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:06,757 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:06,757 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:06,757 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:06,757 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:06,759 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:06,759 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:06,759 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:06,759 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:06,759 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:06,759 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:06,760 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:06,761 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:06,761 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:06,761 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:06,761 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse6 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse7 (not (= 15 ~a8~0))) (.cse3 (= ~a20~0 1)) (.cse8 (not (= 1 ~a7~0))) (.cse5 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~a16~0 4))) (and .cse4 .cse5 .cse2) (and .cse6 .cse3) (and .cse7 .cse2 (= ~a16~0 5)) (and .cse1 .cse8 .cse0 .cse2) (and .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse0 .cse1) (and .cse7 .cse2 .cse3) (and .cse8 .cse5 .cse2))) [2019-11-23 23:31:06,762 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:06,762 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 23:31:06,762 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:06,762 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:06,763 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:06,763 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:06,763 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:06,763 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:06,764 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:06,765 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:06,766 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:06,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:06 BoogieIcfgContainer [2019-11-23 23:31:06,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:06,806 INFO L168 Benchmark]: Toolchain (without parser) took 12259.84 ms. Allocated memory was 143.1 MB in the beginning and 407.4 MB in the end (delta: 264.2 MB). Free memory was 99.1 MB in the beginning and 175.2 MB in the end (delta: -76.1 MB). Peak memory consumption was 188.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:06,807 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:06,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.47 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 98.9 MB in the beginning and 162.7 MB in the end (delta: -63.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:06,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.31 ms. Allocated memory is still 201.3 MB. Free memory was 162.7 MB in the beginning and 156.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:06,814 INFO L168 Benchmark]: Boogie Preprocessor took 108.21 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 151.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:06,816 INFO L168 Benchmark]: RCFGBuilder took 2040.39 ms. Allocated memory was 201.3 MB in the beginning and 254.8 MB in the end (delta: 53.5 MB). Free memory was 151.8 MB in the beginning and 209.0 MB in the end (delta: -57.2 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:06,820 INFO L168 Benchmark]: TraceAbstraction took 9246.38 ms. Allocated memory was 254.8 MB in the beginning and 407.4 MB in the end (delta: 152.6 MB). Free memory was 209.0 MB in the beginning and 175.2 MB in the end (delta: 33.8 MB). Peak memory consumption was 186.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:06,830 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.47 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 98.9 MB in the beginning and 162.7 MB in the end (delta: -63.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 92.31 ms. Allocated memory is still 201.3 MB. Free memory was 162.7 MB in the beginning and 156.9 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.21 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 151.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2040.39 ms. Allocated memory was 201.3 MB in the beginning and 254.8 MB in the end (delta: 53.5 MB). Free memory was 151.8 MB in the beginning and 209.0 MB in the end (delta: -57.2 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9246.38 ms. Allocated memory was 254.8 MB in the beginning and 407.4 MB in the end (delta: 152.6 MB). Free memory was 209.0 MB in the beginning and 175.2 MB in the end (delta: 33.8 MB). Peak memory consumption was 186.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: (((((((((((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) && !(a16 == 4)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || (13 == a8 && a20 == 1)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || (((a12 == 8 && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((!(15 == a8) && a21 == 1) && a20 == 1)) || ((!(1 == a7) && a17 <= 0) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1) && !(a16 == 4)) || ((!(a16 == 6) && a17 <= 0) && a21 == 1)) || (13 == a8 && a20 == 1)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || (((a12 == 8 && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((!(15 == a8) && a21 == 1) && a20 == 1)) || ((!(1 == a7) && a17 <= 0) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 501 SDtfs, 1144 SDslu, 68 SDs, 0 SdLazy, 3101 SolverSat, 796 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 339 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 857 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 49 NumberOfFragments, 215 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2546 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 148 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1261 NumberOfCodeBlocks, 1261 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1413 ConstructedInterpolants, 0 QuantifiedInterpolants, 395384 SizeOfPredicates, 1 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1028/1055 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...