/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_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:24,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:24,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:24,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:24,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:24,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:24,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:24,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:24,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:24,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:24,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:24,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:24,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:24,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:24,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:24,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:24,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:24,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:24,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:24,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:24,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:24,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:24,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:24,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:24,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:24,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:24,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:24,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:24,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:24,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:24,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:24,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:24,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:24,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:24,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:24,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:24,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:24,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:24,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:24,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:24,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:24,454 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:24,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:24,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:24,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:24,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:24,475 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:24,475 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:24,476 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:24,476 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:24,476 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:24,476 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:24,477 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:24,478 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:24,478 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:24,478 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:24,478 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:24,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:24,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:24,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:24,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:24,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:24,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:24,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:24,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:24,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:24,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:24,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:24,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:24,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:24,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:24,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:24,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:24,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:24,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:24,485 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:24,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:24,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:24,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:24,486 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:24,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:24,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:24,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:24,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:24,834 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:24,834 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2019-11-23 23:31:24,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fe7c897/933e5db21193452e9ee3019d8048405b/FLAG193814f32 [2019-11-23 23:31:25,493 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:25,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2019-11-23 23:31:25,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fe7c897/933e5db21193452e9ee3019d8048405b/FLAG193814f32 [2019-11-23 23:31:25,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fe7c897/933e5db21193452e9ee3019d8048405b [2019-11-23 23:31:25,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:25,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:25,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:25,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:25,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:25,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:25" (1/1) ... [2019-11-23 23:31:25,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705ef929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:25, skipping insertion in model container [2019-11-23 23:31:25,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:25" (1/1) ... [2019-11-23 23:31:25,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:25,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:26,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:26,334 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:26,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:26,466 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:26,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:26 WrapperNode [2019-11-23 23:31:26,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:26,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:26,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:26,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:26,477 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:26" (1/1) ... [2019-11-23 23:31:26,495 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:26" (1/1) ... [2019-11-23 23:31:26,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:26,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:26,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:26,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:26,568 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:26" (1/1) ... [2019-11-23 23:31:26,568 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:26" (1/1) ... [2019-11-23 23:31:26,573 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:26" (1/1) ... [2019-11-23 23:31:26,573 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:26" (1/1) ... [2019-11-23 23:31:26,594 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:26" (1/1) ... [2019-11-23 23:31:26,605 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:26" (1/1) ... [2019-11-23 23:31:26,614 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:26" (1/1) ... [2019-11-23 23:31:26,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:26,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:26,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:26,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:26,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:26" (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:26,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:26,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:28,483 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:28,484 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:28,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:28 BoogieIcfgContainer [2019-11-23 23:31:28,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:28,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:28,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:28,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:28,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:25" (1/3) ... [2019-11-23 23:31:28,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a4f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:28, skipping insertion in model container [2019-11-23 23:31:28,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:26" (2/3) ... [2019-11-23 23:31:28,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a4f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:28, skipping insertion in model container [2019-11-23 23:31:28,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:28" (3/3) ... [2019-11-23 23:31:28,495 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label45.c [2019-11-23 23:31:28,504 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:28,512 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:28,523 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:28,548 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:28,549 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:28,549 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:28,549 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:28,549 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:28,549 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:28,549 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:28,549 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:28,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:28,572 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:28,573 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:28,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1323232409, now seen corresponding path program 1 times [2019-11-23 23:31:28,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:28,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472393751] [2019-11-23 23:31:28,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:28,963 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:28,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472393751] [2019-11-23 23:31:28,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:28,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:28,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192967542] [2019-11-23 23:31:28,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:28,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:28,990 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:31:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:29,572 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:31:29,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:29,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:31:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:29,598 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:31:29,598 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:31:29,605 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:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:31:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:31:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:31:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:31:29,681 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:31:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:29,682 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:31:29,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:31:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:31:29,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:29,686 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:29,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 585785311, now seen corresponding path program 1 times [2019-11-23 23:31:29,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:29,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223641019] [2019-11-23 23:31:29,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:29,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223641019] [2019-11-23 23:31:29,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:29,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:29,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437654816] [2019-11-23 23:31:29,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:29,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:29,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:29,770 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:31:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:30,260 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-23 23:31:30,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:30,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:31:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:30,265 INFO L225 Difference]: With dead ends: 431 [2019-11-23 23:31:30,266 INFO L226 Difference]: Without dead ends: 287 [2019-11-23 23:31:30,269 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:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-23 23:31:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-23 23:31:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:31:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 479 transitions. [2019-11-23 23:31:30,297 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 479 transitions. Word has length 76 [2019-11-23 23:31:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:30,298 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 479 transitions. [2019-11-23 23:31:30,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 479 transitions. [2019-11-23 23:31:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:31:30,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:30,302 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:30,302 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1566177589, now seen corresponding path program 1 times [2019-11-23 23:31:30,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:30,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125851449] [2019-11-23 23:31:30,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:30,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125851449] [2019-11-23 23:31:30,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:30,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:30,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472612172] [2019-11-23 23:31:30,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:30,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:30,371 INFO L87 Difference]: Start difference. First operand 287 states and 479 transitions. Second operand 3 states. [2019-11-23 23:31:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:30,791 INFO L93 Difference]: Finished difference Result 644 states and 1076 transitions. [2019-11-23 23:31:30,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:30,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 23:31:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:30,795 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:31:30,795 INFO L226 Difference]: Without dead ends: 358 [2019-11-23 23:31:30,797 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:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-23 23:31:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 287. [2019-11-23 23:31:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:31:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 473 transitions. [2019-11-23 23:31:30,812 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 473 transitions. Word has length 84 [2019-11-23 23:31:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:30,812 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 473 transitions. [2019-11-23 23:31:30,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 473 transitions. [2019-11-23 23:31:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:30,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:30,816 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-23 23:31:30,816 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash -81010275, now seen corresponding path program 1 times [2019-11-23 23:31:30,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:30,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253446166] [2019-11-23 23:31:30,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:30,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253446166] [2019-11-23 23:31:30,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:30,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:30,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216197153] [2019-11-23 23:31:30,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:30,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:30,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:30,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:30,877 INFO L87 Difference]: Start difference. First operand 287 states and 473 transitions. Second operand 4 states. [2019-11-23 23:31:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:31,582 INFO L93 Difference]: Finished difference Result 1070 states and 1768 transitions. [2019-11-23 23:31:31,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:31,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-23 23:31:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:31,587 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:31:31,588 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:31,589 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:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 713. [2019-11-23 23:31:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:31:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1105 transitions. [2019-11-23 23:31:31,621 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1105 transitions. Word has length 93 [2019-11-23 23:31:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:31,621 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1105 transitions. [2019-11-23 23:31:31,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1105 transitions. [2019-11-23 23:31:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:31:31,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:31,625 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:31,625 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2009842188, now seen corresponding path program 1 times [2019-11-23 23:31:31,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:31,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079085006] [2019-11-23 23:31:31,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:31,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079085006] [2019-11-23 23:31:31,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:31,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:31,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210183099] [2019-11-23 23:31:31,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:31,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:31,805 INFO L87 Difference]: Start difference. First operand 713 states and 1105 transitions. Second operand 4 states. [2019-11-23 23:31:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:32,286 INFO L93 Difference]: Finished difference Result 1513 states and 2315 transitions. [2019-11-23 23:31:32,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:32,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-23 23:31:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:32,291 INFO L225 Difference]: With dead ends: 1513 [2019-11-23 23:31:32,291 INFO L226 Difference]: Without dead ends: 801 [2019-11-23 23:31:32,293 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:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-23 23:31:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 784. [2019-11-23 23:31:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1182 transitions. [2019-11-23 23:31:32,322 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1182 transitions. Word has length 99 [2019-11-23 23:31:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:32,323 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1182 transitions. [2019-11-23 23:31:32,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1182 transitions. [2019-11-23 23:31:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 23:31:32,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:32,327 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,328 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1788101700, now seen corresponding path program 1 times [2019-11-23 23:31:32,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:32,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665275869] [2019-11-23 23:31:32,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:32,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665275869] [2019-11-23 23:31:32,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:32,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:32,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483912952] [2019-11-23 23:31:32,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:32,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:32,414 INFO L87 Difference]: Start difference. First operand 784 states and 1182 transitions. Second operand 4 states. [2019-11-23 23:31:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:32,995 INFO L93 Difference]: Finished difference Result 1567 states and 2375 transitions. [2019-11-23 23:31:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:32,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 23:31:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:33,000 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:31:33,000 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:31:33,001 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:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:31:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-23 23:31:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1253 transitions. [2019-11-23 23:31:33,027 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1253 transitions. Word has length 103 [2019-11-23 23:31:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:33,028 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1253 transitions. [2019-11-23 23:31:33,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1253 transitions. [2019-11-23 23:31:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 23:31:33,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:33,032 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,033 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1752326079, now seen corresponding path program 1 times [2019-11-23 23:31:33,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:33,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731147356] [2019-11-23 23:31:33,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 23:31:33,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731147356] [2019-11-23 23:31:33,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:33,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:33,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308669764] [2019-11-23 23:31:33,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:33,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:33,097 INFO L87 Difference]: Start difference. First operand 855 states and 1253 transitions. Second operand 3 states. [2019-11-23 23:31:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:33,556 INFO L93 Difference]: Finished difference Result 1993 states and 2965 transitions. [2019-11-23 23:31:33,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:33,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 23:31:33,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:33,562 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:31:33,562 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:31:33,564 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:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:31:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-23 23:31:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:31:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1147 transitions. [2019-11-23 23:31:33,589 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1147 transitions. Word has length 106 [2019-11-23 23:31:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:33,590 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1147 transitions. [2019-11-23 23:31:33,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1147 transitions. [2019-11-23 23:31:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 23:31:33,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:33,592 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:33,593 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1472782429, now seen corresponding path program 1 times [2019-11-23 23:31:33,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:33,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182223329] [2019-11-23 23:31:33,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:33,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182223329] [2019-11-23 23:31:33,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:33,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:33,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654481920] [2019-11-23 23:31:33,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:31:33,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:31:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:33,680 INFO L87 Difference]: Start difference. First operand 926 states and 1147 transitions. Second operand 5 states. [2019-11-23 23:31:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:34,352 INFO L93 Difference]: Finished difference Result 2490 states and 3153 transitions. [2019-11-23 23:31:34,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:34,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-23 23:31:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:34,361 INFO L225 Difference]: With dead ends: 2490 [2019-11-23 23:31:34,361 INFO L226 Difference]: Without dead ends: 1636 [2019-11-23 23:31:34,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-11-23 23:31:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1352. [2019-11-23 23:31:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-23 23:31:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1624 transitions. [2019-11-23 23:31:34,395 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1624 transitions. Word has length 121 [2019-11-23 23:31:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:34,395 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1624 transitions. [2019-11-23 23:31:34,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:31:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1624 transitions. [2019-11-23 23:31:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 23:31:34,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:34,399 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:34,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1219971369, now seen corresponding path program 1 times [2019-11-23 23:31:34,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:34,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090787079] [2019-11-23 23:31:34,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-23 23:31:34,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090787079] [2019-11-23 23:31:34,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156606250] [2019-11-23 23:31:34,639 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:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:34,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:34,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 23:31:34,865 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 23:31:34,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:34,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-11-23 23:31:34,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695902719] [2019-11-23 23:31:34,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:34,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:34,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:31:34,928 INFO L87 Difference]: Start difference. First operand 1352 states and 1624 transitions. Second operand 3 states. [2019-11-23 23:31:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:35,240 INFO L93 Difference]: Finished difference Result 2845 states and 3410 transitions. [2019-11-23 23:31:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:35,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 23:31:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:35,249 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:31:35,249 INFO L226 Difference]: Without dead ends: 1565 [2019-11-23 23:31:35,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 348 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:31:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-11-23 23:31:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1281. [2019-11-23 23:31:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-11-23 23:31:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1507 transitions. [2019-11-23 23:31:35,293 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1507 transitions. Word has length 175 [2019-11-23 23:31:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:35,295 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 1507 transitions. [2019-11-23 23:31:35,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1507 transitions. [2019-11-23 23:31:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-23 23:31:35,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:35,299 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:35,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:35,504 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1399297145, now seen corresponding path program 1 times [2019-11-23 23:31:35,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:35,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959654159] [2019-11-23 23:31:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 23:31:35,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959654159] [2019-11-23 23:31:35,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632590577] [2019-11-23 23:31:35,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:35,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:31:35,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:31:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:31:36,042 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:31:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-23 23:31:36,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:31:36,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:31:36,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857339709] [2019-11-23 23:31:36,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:36,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:36,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:36,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:31:36,118 INFO L87 Difference]: Start difference. First operand 1281 states and 1507 transitions. Second operand 3 states. [2019-11-23 23:31:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:36,506 INFO L93 Difference]: Finished difference Result 2772 states and 3288 transitions. [2019-11-23 23:31:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:36,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-23 23:31:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:36,507 INFO L225 Difference]: With dead ends: 2772 [2019-11-23 23:31:36,507 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:36,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 426 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:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:36,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2019-11-23 23:31:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:36,512 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:36,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:36,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:36,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:31:36,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:37,023 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-11-23 23:31:37,161 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-11-23 23:31:37,165 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:37,165 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:37,165 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:37,165 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:37,165 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:37,165 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:37,165 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:37,166 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:37,166 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:37,166 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:37,166 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:37,166 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:37,166 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:37,167 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:37,167 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:37,167 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:37,167 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:37,169 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (= ~a20~0 1)) (.cse5 (= ~a16~0 5))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 (not (= ~a16~0 6)) .cse2 .cse3) (and .cse2 .cse3 .cse1) (and .cse4 .cse5) (and .cse4 .cse2 .cse3) (= 15 ~a8~0) (and .cse0 .cse2 .cse1 .cse5) (<= ~a16~0 4))) [2019-11-23 23:31:37,169 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:37,169 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:37,170 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:37,170 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:37,170 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:37,170 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:37,170 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:37,172 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:37,172 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:37,172 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:37,172 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:37,173 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:37,174 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:37,174 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:37,174 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:37,174 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:37,175 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (= ~a20~0 1)) (.cse5 (= ~a16~0 5))) (or (and .cse0 (<= ~a17~0 0) .cse1) (and .cse0 (not (= ~a16~0 6)) .cse2 .cse3) (and .cse2 .cse3 .cse1) (and .cse4 .cse5) (and .cse4 .cse2 .cse3) (= 15 ~a8~0) (and .cse0 .cse2 .cse1 .cse5) (<= ~a16~0 4))) [2019-11-23 23:31:37,175 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:37,175 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:37,176 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:37,176 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:37,176 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:37,176 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:37,176 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:37,177 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:37,177 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:37,177 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:37,177 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:37,178 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:37,179 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2019-11-23 23:31:37,180 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:37,180 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:37,180 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:37,180 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:37,180 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:37,181 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:37,181 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:37,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:37 BoogieIcfgContainer [2019-11-23 23:31:37,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:37,234 INFO L168 Benchmark]: Toolchain (without parser) took 11484.34 ms. Allocated memory was 140.0 MB in the beginning and 430.4 MB in the end (delta: 290.5 MB). Free memory was 103.2 MB in the beginning and 345.3 MB in the end (delta: -242.1 MB). Peak memory consumption was 247.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:37,235 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:37,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.26 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 103.0 MB in the beginning and 172.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:37,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.06 ms. Allocated memory is still 206.6 MB. Free memory was 172.6 MB in the beginning and 166.4 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:37,237 INFO L168 Benchmark]: Boogie Preprocessor took 74.06 ms. Allocated memory is still 206.6 MB. Free memory was 166.4 MB in the beginning and 161.6 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:37,239 INFO L168 Benchmark]: RCFGBuilder took 1850.84 ms. Allocated memory was 206.6 MB in the beginning and 249.0 MB in the end (delta: 42.5 MB). Free memory was 161.6 MB in the beginning and 197.7 MB in the end (delta: -36.1 MB). Peak memory consumption was 110.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:37,240 INFO L168 Benchmark]: TraceAbstraction took 8742.77 ms. Allocated memory was 249.0 MB in the beginning and 430.4 MB in the end (delta: 181.4 MB). Free memory was 197.7 MB in the beginning and 345.3 MB in the end (delta: -147.6 MB). Peak memory consumption was 233.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:37,249 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.26 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 103.0 MB in the beginning and 172.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.06 ms. Allocated memory is still 206.6 MB. Free memory was 172.6 MB in the beginning and 166.4 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.06 ms. Allocated memory is still 206.6 MB. Free memory was 166.4 MB in the beginning and 161.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1850.84 ms. Allocated memory was 206.6 MB in the beginning and 249.0 MB in the end (delta: 42.5 MB). Free memory was 161.6 MB in the beginning and 197.7 MB in the end (delta: -36.1 MB). Peak memory consumption was 110.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8742.77 ms. Allocated memory was 249.0 MB in the beginning and 430.4 MB in the end (delta: 181.4 MB). Free memory was 197.7 MB in the beginning and 345.3 MB in the end (delta: -147.6 MB). Peak memory consumption was 233.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: 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 <= 0) && a20 == 1) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (14 <= a8 && a16 == 5)) || ((14 <= a8 && a17 == 1) && a21 == 1)) || 15 == a8) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a17 <= 0) && a20 == 1) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (14 <= a8 && a16 == 5)) || ((14 <= a8 && a17 == 1) && a21 == 1)) || 15 == a8) || (((1 == a7 && a17 == 1) && a20 == 1) && a16 == 5)) || a16 <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 8.6s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 540 SDtfs, 868 SDslu, 66 SDs, 0 SdLazy, 2848 SolverSat, 667 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 783 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1352occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 869 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 53 NumberOfFragments, 143 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3391 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 302 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1531 NumberOfCodeBlocks, 1531 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1906 ConstructedInterpolants, 0 QuantifiedInterpolants, 642789 SizeOfPredicates, 2 NumberOfNonLiveVariables, 799 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1384/1520 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...