/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_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:55,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:55,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:56,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:56,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:56,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:56,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:56,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:56,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:56,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:56,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:56,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:56,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:56,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:56,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:56,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:56,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:56,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:56,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:56,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:56,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:56,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:56,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:56,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:56,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:56,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:56,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:56,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:56,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:56,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:56,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:56,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:56,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:56,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:56,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:56,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:56,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:56,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:56,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:56,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:56,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:56,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:29:56,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:56,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:56,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:56,093 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:56,093 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:56,094 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:56,094 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:56,094 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:56,094 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:56,094 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:56,095 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:56,096 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:56,096 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:56,096 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:56,097 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:56,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:56,098 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:56,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:56,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:56,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:56,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:56,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:56,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:56,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:56,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:56,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:56,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:56,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:56,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:56,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:56,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:56,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:56,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:56,103 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:56,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:56,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:56,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:56,104 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:56,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:56,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:56,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:56,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:56,409 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:56,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label09.c [2019-11-23 23:29:56,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f6c5f819/46ee3b2610e847aab43d614231e634c3/FLAGb842cab05 [2019-11-23 23:29:57,081 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:57,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label09.c [2019-11-23 23:29:57,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f6c5f819/46ee3b2610e847aab43d614231e634c3/FLAGb842cab05 [2019-11-23 23:29:57,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f6c5f819/46ee3b2610e847aab43d614231e634c3 [2019-11-23 23:29:57,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:57,362 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:57,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:57,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:57,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:57,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:57" (1/1) ... [2019-11-23 23:29:57,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5014cfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:57, skipping insertion in model container [2019-11-23 23:29:57,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:57" (1/1) ... [2019-11-23 23:29:57,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:57,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:58,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:58,126 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:58,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:58,219 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:58,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58 WrapperNode [2019-11-23 23:29:58,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:58,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:58,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:58,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:58,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:58,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:58,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:58,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:58,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... [2019-11-23 23:29:58,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:58,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:58,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:58,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:58,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:58,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:58,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:00,363 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:00,364 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:00,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:00 BoogieIcfgContainer [2019-11-23 23:30:00,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:00,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:00,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:00,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:00,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:57" (1/3) ... [2019-11-23 23:30:00,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8103ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:00, skipping insertion in model container [2019-11-23 23:30:00,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:58" (2/3) ... [2019-11-23 23:30:00,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8103ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:00, skipping insertion in model container [2019-11-23 23:30:00,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:00" (3/3) ... [2019-11-23 23:30:00,374 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label09.c [2019-11-23 23:30:00,382 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:00,387 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:00,397 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:00,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:00,423 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:00,423 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:00,423 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:00,423 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:00,424 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:00,424 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:00,424 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:00,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:00,454 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:00,454 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:00,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1323232153, now seen corresponding path program 1 times [2019-11-23 23:30:00,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:00,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342449771] [2019-11-23 23:30:00,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:00,888 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:00,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342449771] [2019-11-23 23:30:00,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:00,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:00,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126864978] [2019-11-23 23:30:00,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:00,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:00,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:00,914 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:01,664 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:01,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:01,690 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:01,690 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:01,696 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:30:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:30:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:01,777 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:01,779 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:01,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:30:01,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:01,787 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:01,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:01,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1048384774, now seen corresponding path program 1 times [2019-11-23 23:30:01,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:01,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091904302] [2019-11-23 23:30:01,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:01,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091904302] [2019-11-23 23:30:01,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:01,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:01,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362152576] [2019-11-23 23:30:01,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:01,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:01,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:01,891 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:02,526 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:30:02,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:02,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:30:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:02,532 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:30:02,532 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:02,534 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:30:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-23 23:30:02,567 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-23 23:30:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:02,568 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-23 23:30:02,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-23 23:30:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:02,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:02,572 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:02,572 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2123289446, now seen corresponding path program 1 times [2019-11-23 23:30:02,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:02,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833060412] [2019-11-23 23:30:02,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:02,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833060412] [2019-11-23 23:30:02,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:02,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:02,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096458411] [2019-11-23 23:30:02,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:02,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:02,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:02,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:02,655 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-23 23:30:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:03,015 INFO L93 Difference]: Finished difference Result 1212 states and 1980 transitions. [2019-11-23 23:30:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:03,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-23 23:30:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:03,020 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:30:03,021 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:03,022 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:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-23 23:30:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:30:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 955 transitions. [2019-11-23 23:30:03,051 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 955 transitions. Word has length 78 [2019-11-23 23:30:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:03,052 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 955 transitions. [2019-11-23 23:30:03,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 955 transitions. [2019-11-23 23:30:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 23:30:03,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:03,058 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:03,059 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2133664500, now seen corresponding path program 1 times [2019-11-23 23:30:03,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:03,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493297078] [2019-11-23 23:30:03,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:03,132 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:03,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493297078] [2019-11-23 23:30:03,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:03,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:03,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747572359] [2019-11-23 23:30:03,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:03,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:03,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:03,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:03,137 INFO L87 Difference]: Start difference. First operand 642 states and 955 transitions. Second operand 3 states. [2019-11-23 23:30:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:03,535 INFO L93 Difference]: Finished difference Result 1496 states and 2249 transitions. [2019-11-23 23:30:03,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:03,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-23 23:30:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:03,541 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 23:30:03,541 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:30:03,543 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:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:30:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 713. [2019-11-23 23:30:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1057 transitions. [2019-11-23 23:30:03,565 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1057 transitions. Word has length 94 [2019-11-23 23:30:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:03,566 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1057 transitions. [2019-11-23 23:30:03,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1057 transitions. [2019-11-23 23:30:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 23:30:03,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:03,570 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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:30:03,571 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:03,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash 501983831, now seen corresponding path program 1 times [2019-11-23 23:30:03,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:03,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160762879] [2019-11-23 23:30:03,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 23:30:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160762879] [2019-11-23 23:30:03,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:03,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:03,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890983103] [2019-11-23 23:30:03,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:03,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:03,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:03,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:03,642 INFO L87 Difference]: Start difference. First operand 713 states and 1057 transitions. Second operand 3 states. [2019-11-23 23:30:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:04,033 INFO L93 Difference]: Finished difference Result 1780 states and 2618 transitions. [2019-11-23 23:30:04,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:04,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 23:30:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:04,039 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:30:04,039 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:04,041 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:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-23 23:30:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1241 transitions. [2019-11-23 23:30:04,093 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1241 transitions. Word has length 105 [2019-11-23 23:30:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:04,094 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1241 transitions. [2019-11-23 23:30:04,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1241 transitions. [2019-11-23 23:30:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:30:04,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:04,099 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,099 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1784758293, now seen corresponding path program 1 times [2019-11-23 23:30:04,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:04,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390761884] [2019-11-23 23:30:04,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:30:04,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390761884] [2019-11-23 23:30:04,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:04,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:04,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008425443] [2019-11-23 23:30:04,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:04,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:04,185 INFO L87 Difference]: Start difference. First operand 855 states and 1241 transitions. Second operand 4 states. [2019-11-23 23:30:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:04,657 INFO L93 Difference]: Finished difference Result 1809 states and 2593 transitions. [2019-11-23 23:30:04,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:04,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-23 23:30:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:04,662 INFO L225 Difference]: With dead ends: 1809 [2019-11-23 23:30:04,663 INFO L226 Difference]: Without dead ends: 955 [2019-11-23 23:30:04,664 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:30:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-23 23:30:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 926. [2019-11-23 23:30:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1318 transitions. [2019-11-23 23:30:04,688 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1318 transitions. Word has length 113 [2019-11-23 23:30:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:04,689 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1318 transitions. [2019-11-23 23:30:04,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1318 transitions. [2019-11-23 23:30:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 23:30:04,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:04,692 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:30:04,692 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash 509280291, now seen corresponding path program 1 times [2019-11-23 23:30:04,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:04,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509736021] [2019-11-23 23:30:04,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:04,750 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:30:04,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509736021] [2019-11-23 23:30:04,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:04,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:04,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665681417] [2019-11-23 23:30:04,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:04,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:04,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:04,752 INFO L87 Difference]: Start difference. First operand 926 states and 1318 transitions. Second operand 4 states. [2019-11-23 23:30:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:05,223 INFO L93 Difference]: Finished difference Result 1780 states and 2558 transitions. [2019-11-23 23:30:05,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:05,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-23 23:30:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:05,228 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:30:05,228 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:30:05,230 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:30:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:30:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-23 23:30:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1312 transitions. [2019-11-23 23:30:05,250 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1312 transitions. Word has length 117 [2019-11-23 23:30:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:05,250 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1312 transitions. [2019-11-23 23:30:05,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1312 transitions. [2019-11-23 23:30:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:30:05,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:05,254 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:30:05,254 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1638326758, now seen corresponding path program 1 times [2019-11-23 23:30:05,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:05,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738495374] [2019-11-23 23:30:05,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:05,507 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:30:05,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738495374] [2019-11-23 23:30:05,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:05,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 23:30:05,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003537055] [2019-11-23 23:30:05,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:30:05,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:30:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:05,510 INFO L87 Difference]: Start difference. First operand 926 states and 1312 transitions. Second operand 6 states. [2019-11-23 23:30:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:06,289 INFO L93 Difference]: Finished difference Result 2067 states and 2917 transitions. [2019-11-23 23:30:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 23:30:06,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-23 23:30:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:06,295 INFO L225 Difference]: With dead ends: 2067 [2019-11-23 23:30:06,295 INFO L226 Difference]: Without dead ends: 1213 [2019-11-23 23:30:06,297 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:30:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-11-23 23:30:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2019-11-23 23:30:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1465 transitions. [2019-11-23 23:30:06,322 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1465 transitions. Word has length 131 [2019-11-23 23:30:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:06,323 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1465 transitions. [2019-11-23 23:30:06,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:30:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1465 transitions. [2019-11-23 23:30:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 23:30:06,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:06,327 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:30:06,327 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1291929313, now seen corresponding path program 1 times [2019-11-23 23:30:06,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:06,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49407972] [2019-11-23 23:30:06,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:06,398 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:30:06,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49407972] [2019-11-23 23:30:06,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:06,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:06,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091531269] [2019-11-23 23:30:06,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:06,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:06,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:06,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:06,401 INFO L87 Difference]: Start difference. First operand 1068 states and 1465 transitions. Second operand 4 states. [2019-11-23 23:30:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:06,955 INFO L93 Difference]: Finished difference Result 2845 states and 3881 transitions. [2019-11-23 23:30:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:06,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 23:30:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:06,962 INFO L225 Difference]: With dead ends: 2845 [2019-11-23 23:30:06,962 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:30:06,964 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:30:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:30:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1139. [2019-11-23 23:30:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-23 23:30:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1313 transitions. [2019-11-23 23:30:06,993 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1313 transitions. Word has length 134 [2019-11-23 23:30:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:06,994 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1313 transitions. [2019-11-23 23:30:06,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1313 transitions. [2019-11-23 23:30:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 23:30:06,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:06,998 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:30:06,998 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2055484374, now seen corresponding path program 1 times [2019-11-23 23:30:06,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:06,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851066496] [2019-11-23 23:30:06,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:07,162 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:30:07,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851066496] [2019-11-23 23:30:07,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499004013] [2019-11-23 23:30:07,163 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:30:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:07,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:30:07,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:30:07,325 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:30:07,325 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:30:07,367 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:30:07,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:30:07,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 8 [2019-11-23 23:30:07,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663974444] [2019-11-23 23:30:07,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:07,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:07,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:07,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:07,370 INFO L87 Difference]: Start difference. First operand 1139 states and 1313 transitions. Second operand 4 states. [2019-11-23 23:30:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:07,783 INFO L93 Difference]: Finished difference Result 1210 states and 1386 transitions. [2019-11-23 23:30:07,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:07,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-23 23:30:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:07,785 INFO L225 Difference]: With dead ends: 1210 [2019-11-23 23:30:07,785 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:07,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:07,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2019-11-23 23:30:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:07,789 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:07,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:07,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:07,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:08,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:08,281 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2019-11-23 23:30:08,422 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2019-11-23 23:30:08,425 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:08,425 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:08,425 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:08,426 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:08,427 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:08,427 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:08,427 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:08,427 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:08,427 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:08,428 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:08,429 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1)) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (<= 15 ~a8~0) .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse4 .cse0 .cse1) (and .cse2 .cse4 (= ~a17~0 1) (= ~a12~0 8)) (and (< 13 ~a8~0) .cse4 .cse1))) [2019-11-23 23:30:08,429 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:08,429 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:08,430 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:08,430 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:08,430 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:08,430 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:08,430 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:08,431 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:08,432 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:08,432 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:08,432 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:08,432 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:08,432 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:08,432 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:08,432 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:08,433 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:08,433 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:08,433 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:08,433 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:08,433 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:08,433 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:08,433 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:08,434 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:08,434 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1)) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (<= 15 ~a8~0) .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse4 .cse0 .cse1) (and .cse2 .cse4 (= ~a17~0 1) (= ~a12~0 8)) (and (< 13 ~a8~0) .cse4 .cse1))) [2019-11-23 23:30:08,434 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:08,434 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:08,435 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:08,435 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:08,435 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:08,435 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:08,435 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:08,436 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:08,436 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:08,436 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:08,437 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:08,437 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:08,437 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:08,437 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:08,437 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:08,437 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:08,437 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:08,438 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:08,438 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:08,438 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:08,438 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:08,438 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:08,438 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:08,439 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:08,439 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2019-11-23 23:30:08,439 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:08,439 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:08,439 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:08,439 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:08,440 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:08,440 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 23:30:08,440 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:08,440 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:08,440 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:08,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:08 BoogieIcfgContainer [2019-11-23 23:30:08,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:08,488 INFO L168 Benchmark]: Toolchain (without parser) took 11124.44 ms. Allocated memory was 146.8 MB in the beginning and 373.8 MB in the end (delta: 227.0 MB). Free memory was 101.5 MB in the beginning and 235.9 MB in the end (delta: -134.5 MB). Peak memory consumption was 92.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:08,489 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:08,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.85 ms. Allocated memory was 146.8 MB in the beginning and 209.2 MB in the end (delta: 62.4 MB). Free memory was 101.3 MB in the beginning and 171.9 MB in the end (delta: -70.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:08,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.63 ms. Allocated memory is still 209.2 MB. Free memory was 171.9 MB in the beginning and 166.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:08,492 INFO L168 Benchmark]: Boogie Preprocessor took 67.07 ms. Allocated memory is still 209.2 MB. Free memory was 166.5 MB in the beginning and 161.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:08,495 INFO L168 Benchmark]: RCFGBuilder took 1991.99 ms. Allocated memory was 209.2 MB in the beginning and 244.3 MB in the end (delta: 35.1 MB). Free memory was 161.2 MB in the beginning and 183.8 MB in the end (delta: -22.6 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:08,496 INFO L168 Benchmark]: TraceAbstraction took 8116.73 ms. Allocated memory was 244.3 MB in the beginning and 373.8 MB in the end (delta: 129.5 MB). Free memory was 183.8 MB in the beginning and 235.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:08,507 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 856.85 ms. Allocated memory was 146.8 MB in the beginning and 209.2 MB in the end (delta: 62.4 MB). Free memory was 101.3 MB in the beginning and 171.9 MB in the end (delta: -70.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.63 ms. Allocated memory is still 209.2 MB. Free memory was 171.9 MB in the beginning and 166.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.07 ms. Allocated memory is still 209.2 MB. Free memory was 166.5 MB in the beginning and 161.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1991.99 ms. Allocated memory was 209.2 MB in the beginning and 244.3 MB in the end (delta: 35.1 MB). Free memory was 161.2 MB in the beginning and 183.8 MB in the end (delta: -22.6 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8116.73 ms. Allocated memory was 244.3 MB in the beginning and 373.8 MB in the end (delta: 129.5 MB). Free memory was 183.8 MB in the beginning and 235.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 530]: 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: ((((((15 <= a8 && !(1 == a7)) && a21 == 1) || (13 == a8 && a20 == 1)) || (a21 == 1 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((15 <= a8 && !(1 == a7)) && a21 == 1) || (13 == a8 && a20 == 1)) || (a21 == 1 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 430 SDtfs, 1358 SDslu, 82 SDs, 0 SdLazy, 3179 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 337 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=9, 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, 955 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 127 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7568 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 360 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 400438 SizeOfPredicates, 1 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1008/1035 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...