/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_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:38,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:38,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:38,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:38,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:38,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:38,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:38,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:38,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:38,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:38,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:38,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:38,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:38,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:38,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:38,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:38,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:38,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:38,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:38,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:38,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:38,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:38,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:38,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:38,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:38,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:38,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:38,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:38,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:38,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:38,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:38,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:38,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:38,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:38,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:38,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:38,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:38,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:38,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:38,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:38,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:38,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:30:38,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:38,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:38,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:38,122 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:38,122 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:38,123 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:38,123 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:38,123 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:38,123 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:38,123 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:38,123 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:38,124 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:38,124 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:38,124 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:38,124 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:38,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:38,125 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:38,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:38,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:38,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:38,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:38,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:38,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:38,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:38,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:38,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:38,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:38,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:38,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:38,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:38,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:38,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:38,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:38,129 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:38,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:38,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:38,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:38,130 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:38,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:38,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:38,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:38,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:38,444 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:38,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23.c [2019-11-23 23:30:38,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6037b2ef2/c53ed67784f44ff19245a4c060667116/FLAG4d2ca1a92 [2019-11-23 23:30:39,104 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:39,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23.c [2019-11-23 23:30:39,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6037b2ef2/c53ed67784f44ff19245a4c060667116/FLAG4d2ca1a92 [2019-11-23 23:30:39,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6037b2ef2/c53ed67784f44ff19245a4c060667116 [2019-11-23 23:30:39,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:39,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:39,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:39,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:39,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:39,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cddf010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39, skipping insertion in model container [2019-11-23 23:30:39,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:39,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:40,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:40,052 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:40,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:40,162 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:40,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40 WrapperNode [2019-11-23 23:30:40,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:40,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:40,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:40,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:40,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:40,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:40,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:40,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:40,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... [2019-11-23 23:30:40,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:40,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:40,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:40,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:40,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:40,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:42,463 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:42,464 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:42,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:42 BoogieIcfgContainer [2019-11-23 23:30:42,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:42,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:42,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:42,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:42,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:39" (1/3) ... [2019-11-23 23:30:42,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3523b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:42, skipping insertion in model container [2019-11-23 23:30:42,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:40" (2/3) ... [2019-11-23 23:30:42,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3523b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:42, skipping insertion in model container [2019-11-23 23:30:42,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:42" (3/3) ... [2019-11-23 23:30:42,473 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label23.c [2019-11-23 23:30:42,483 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:42,491 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:42,503 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:42,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:42,529 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:42,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:42,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:42,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:42,530 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:42,530 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:42,530 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:42,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:42,558 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:42,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:42,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1323243807, now seen corresponding path program 1 times [2019-11-23 23:30:42,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:42,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364683531] [2019-11-23 23:30:42,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:42,984 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:42,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364683531] [2019-11-23 23:30:42,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:42,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:42,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181328903] [2019-11-23 23:30:42,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:42,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:43,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:43,022 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:43,806 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:43,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:43,831 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:43,832 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:43,837 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:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:30:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:30:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-11-23 23:30:43,956 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-11-23 23:30:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:43,957 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-11-23 23:30:43,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-11-23 23:30:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:43,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:43,961 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:43,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2123301100, now seen corresponding path program 1 times [2019-11-23 23:30:43,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:43,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229043455] [2019-11-23 23:30:43,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:44,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229043455] [2019-11-23 23:30:44,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:44,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:44,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771782420] [2019-11-23 23:30:44,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:44,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:44,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:44,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:44,125 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 4 states. [2019-11-23 23:30:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:44,720 INFO L93 Difference]: Finished difference Result 786 states and 1358 transitions. [2019-11-23 23:30:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:44,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:30:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:44,726 INFO L225 Difference]: With dead ends: 786 [2019-11-23 23:30:44,726 INFO L226 Difference]: Without dead ends: 571 [2019-11-23 23:30:44,729 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:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-23 23:30:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 358. [2019-11-23 23:30:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-23 23:30:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-11-23 23:30:44,768 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-11-23 23:30:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:44,768 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-11-23 23:30:44,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-11-23 23:30:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-23 23:30:44,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:44,774 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:44,775 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1800585521, now seen corresponding path program 1 times [2019-11-23 23:30:44,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:44,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370865108] [2019-11-23 23:30:44,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:44,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370865108] [2019-11-23 23:30:44,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:44,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:44,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672012695] [2019-11-23 23:30:44,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:44,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:44,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:44,879 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-11-23 23:30:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:45,444 INFO L93 Difference]: Finished difference Result 857 states and 1277 transitions. [2019-11-23 23:30:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:45,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-23 23:30:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:45,448 INFO L225 Difference]: With dead ends: 857 [2019-11-23 23:30:45,448 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:45,451 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:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-11-23 23:30:45,475 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 92 [2019-11-23 23:30:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:45,476 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-11-23 23:30:45,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-11-23 23:30:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:30:45,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:45,479 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:45,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:45,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1032089676, now seen corresponding path program 1 times [2019-11-23 23:30:45,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:45,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826749025] [2019-11-23 23:30:45,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:45,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826749025] [2019-11-23 23:30:45,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:45,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:45,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960434226] [2019-11-23 23:30:45,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:45,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:45,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:45,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:45,526 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-11-23 23:30:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:45,903 INFO L93 Difference]: Finished difference Result 1212 states and 1622 transitions. [2019-11-23 23:30:45,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:45,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:30:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:45,907 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:30:45,907 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:30:45,908 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:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:30:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-23 23:30:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:30:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2019-11-23 23:30:45,964 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 93 [2019-11-23 23:30:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:45,965 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2019-11-23 23:30:45,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2019-11-23 23:30:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:30:45,968 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:45,969 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,969 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash 143195268, now seen corresponding path program 1 times [2019-11-23 23:30:45,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:45,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207375562] [2019-11-23 23:30:45,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:30:46,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207375562] [2019-11-23 23:30:46,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:46,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275233457] [2019-11-23 23:30:46,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:46,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:46,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:46,043 INFO L87 Difference]: Start difference. First operand 642 states and 833 transitions. Second operand 3 states. [2019-11-23 23:30:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,399 INFO L93 Difference]: Finished difference Result 1709 states and 2233 transitions. [2019-11-23 23:30:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:46,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:30:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,407 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:30:46,407 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:46,408 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:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-23 23:30:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1121 transitions. [2019-11-23 23:30:46,432 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1121 transitions. Word has length 97 [2019-11-23 23:30:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:46,432 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1121 transitions. [2019-11-23 23:30:46,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1121 transitions. [2019-11-23 23:30:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 23:30:46,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:46,435 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:46,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1126553310, now seen corresponding path program 1 times [2019-11-23 23:30:46,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:46,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995109060] [2019-11-23 23:30:46,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:46,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995109060] [2019-11-23 23:30:46,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:46,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367065242] [2019-11-23 23:30:46,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:46,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:46,484 INFO L87 Difference]: Start difference. First operand 855 states and 1121 transitions. Second operand 3 states. [2019-11-23 23:30:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,772 INFO L93 Difference]: Finished difference Result 1780 states and 2333 transitions. [2019-11-23 23:30:46,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:46,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 23:30:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,777 INFO L225 Difference]: With dead ends: 1780 [2019-11-23 23:30:46,778 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:30:46,779 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:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:30:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 855. [2019-11-23 23:30:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1121 transitions. [2019-11-23 23:30:46,802 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1121 transitions. Word has length 99 [2019-11-23 23:30:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:46,803 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1121 transitions. [2019-11-23 23:30:46,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1121 transitions. [2019-11-23 23:30:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 23:30:46,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:46,806 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:46,806 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:46,812 INFO L82 PathProgramCache]: Analyzing trace with hash 397469725, now seen corresponding path program 1 times [2019-11-23 23:30:46,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:46,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917108385] [2019-11-23 23:30:46,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:46,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917108385] [2019-11-23 23:30:46,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:46,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863244927] [2019-11-23 23:30:46,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:46,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:46,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:46,938 INFO L87 Difference]: Start difference. First operand 855 states and 1121 transitions. Second operand 3 states. [2019-11-23 23:30:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:47,238 INFO L93 Difference]: Finished difference Result 1922 states and 2491 transitions. [2019-11-23 23:30:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:47,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 23:30:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:47,243 INFO L225 Difference]: With dead ends: 1922 [2019-11-23 23:30:47,244 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:47,245 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:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-23 23:30:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1284 transitions. [2019-11-23 23:30:47,268 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1284 transitions. Word has length 100 [2019-11-23 23:30:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:47,268 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1284 transitions. [2019-11-23 23:30:47,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1284 transitions. [2019-11-23 23:30:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 23:30:47,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:47,271 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:47,272 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:47,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2113449189, now seen corresponding path program 1 times [2019-11-23 23:30:47,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:47,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696224160] [2019-11-23 23:30:47,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:47,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696224160] [2019-11-23 23:30:47,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:47,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:30:47,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171962682] [2019-11-23 23:30:47,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:30:47,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:30:47,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:47,439 INFO L87 Difference]: Start difference. First operand 997 states and 1284 transitions. Second operand 8 states. [2019-11-23 23:30:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:48,251 INFO L93 Difference]: Finished difference Result 2106 states and 2699 transitions. [2019-11-23 23:30:48,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:30:48,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-11-23 23:30:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:48,257 INFO L225 Difference]: With dead ends: 2106 [2019-11-23 23:30:48,257 INFO L226 Difference]: Without dead ends: 1181 [2019-11-23 23:30:48,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-11-23 23:30:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 997. [2019-11-23 23:30:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1272 transitions. [2019-11-23 23:30:48,283 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1272 transitions. Word has length 104 [2019-11-23 23:30:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:48,283 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1272 transitions. [2019-11-23 23:30:48,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:30:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1272 transitions. [2019-11-23 23:30:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-23 23:30:48,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:48,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,287 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 58782268, now seen corresponding path program 1 times [2019-11-23 23:30:48,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:48,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463292071] [2019-11-23 23:30:48,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-23 23:30:48,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463292071] [2019-11-23 23:30:48,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:48,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:48,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109517022] [2019-11-23 23:30:48,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:48,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:48,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:48,339 INFO L87 Difference]: Start difference. First operand 997 states and 1272 transitions. Second operand 3 states. [2019-11-23 23:30:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:48,627 INFO L93 Difference]: Finished difference Result 1993 states and 2541 transitions. [2019-11-23 23:30:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:48,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-23 23:30:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:48,632 INFO L225 Difference]: With dead ends: 1993 [2019-11-23 23:30:48,632 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:48,634 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:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-11-23 23:30:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1067 transitions. [2019-11-23 23:30:48,656 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1067 transitions. Word has length 127 [2019-11-23 23:30:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:48,656 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1067 transitions. [2019-11-23 23:30:48,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1067 transitions. [2019-11-23 23:30:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 23:30:48,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:48,659 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:48,659 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash 646847506, now seen corresponding path program 1 times [2019-11-23 23:30:48,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:48,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681538008] [2019-11-23 23:30:48,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:48,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681538008] [2019-11-23 23:30:48,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:48,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:48,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590780658] [2019-11-23 23:30:48,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:48,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:48,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:48,762 INFO L87 Difference]: Start difference. First operand 926 states and 1067 transitions. Second operand 4 states. [2019-11-23 23:30:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:49,074 INFO L93 Difference]: Finished difference Result 1851 states and 2146 transitions. [2019-11-23 23:30:49,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:49,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-23 23:30:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:49,080 INFO L225 Difference]: With dead ends: 1851 [2019-11-23 23:30:49,080 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:49,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:30:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1119 transitions. [2019-11-23 23:30:49,104 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1119 transitions. Word has length 130 [2019-11-23 23:30:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:49,104 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1119 transitions. [2019-11-23 23:30:49,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1119 transitions. [2019-11-23 23:30:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:30:49,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:49,107 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, 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] [2019-11-23 23:30:49,108 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash -730918157, now seen corresponding path program 1 times [2019-11-23 23:30:49,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:49,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326937246] [2019-11-23 23:30:49,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:49,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326937246] [2019-11-23 23:30:49,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:49,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 23:30:49,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24041317] [2019-11-23 23:30:49,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 23:30:49,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 23:30:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 23:30:49,636 INFO L87 Difference]: Start difference. First operand 997 states and 1119 transitions. Second operand 12 states. [2019-11-23 23:30:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:50,427 INFO L93 Difference]: Finished difference Result 2046 states and 2307 transitions. [2019-11-23 23:30:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 23:30:50,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-11-23 23:30:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:50,428 INFO L225 Difference]: With dead ends: 2046 [2019-11-23 23:30:50,428 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:50,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 23:30:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:50,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2019-11-23 23:30:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:50,432 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:50,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 23:30:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:50,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:50,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:50,744 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-23 23:30:50,748 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:50,748 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:50,748 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:50,748 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:50,749 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:50,750 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:50,750 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:50,750 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:50,750 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:50,750 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:50,751 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= ~a20~0 1))) (.cse1 (not (= 1 ~a7~0))) (.cse3 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (= ~a16~0 5)) (not (= 15 ~a8~0)) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))))) [2019-11-23 23:30:50,751 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:50,751 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:50,751 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:50,751 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:50,751 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:50,751 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:50,751 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:50,752 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:50,752 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:50,752 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:50,752 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:50,752 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:50,752 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:50,752 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:50,753 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:50,754 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:50,754 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a20~0 1))) (.cse1 (not (= 1 ~a7~0))) (.cse3 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (= ~a16~0 5)) (not (= 15 ~a8~0)) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))))) [2019-11-23 23:30:50,754 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:50,754 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:50,754 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:50,754 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:50,754 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:50,755 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:50,755 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:50,755 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:50,755 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:50,755 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:50,755 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:50,755 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:50,756 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:50,757 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:50,757 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 23:30:50,757 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:50,757 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:50,757 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:50,757 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2019-11-23 23:30:50,757 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:50,758 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:50,758 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:50,758 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:50,758 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:50,758 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:50,758 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:50,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:50 BoogieIcfgContainer [2019-11-23 23:30:50,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:50,781 INFO L168 Benchmark]: Toolchain (without parser) took 11398.15 ms. Allocated memory was 144.2 MB in the beginning and 390.6 MB in the end (delta: 246.4 MB). Free memory was 99.7 MB in the beginning and 284.4 MB in the end (delta: -184.8 MB). Peak memory consumption was 61.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:50,782 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 144.2 MB. Free memory is still 120.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:30:50,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.94 ms. Allocated memory was 144.2 MB in the beginning and 203.9 MB in the end (delta: 59.8 MB). Free memory was 99.4 MB in the beginning and 169.5 MB in the end (delta: -70.1 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:50,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.70 ms. Allocated memory is still 203.9 MB. Free memory was 169.5 MB in the beginning and 163.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:50,784 INFO L168 Benchmark]: Boogie Preprocessor took 68.51 ms. Allocated memory is still 203.9 MB. Free memory was 163.9 MB in the beginning and 159.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:50,785 INFO L168 Benchmark]: RCFGBuilder took 2142.71 ms. Allocated memory was 203.9 MB in the beginning and 251.1 MB in the end (delta: 47.2 MB). Free memory was 159.0 MB in the beginning and 209.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:50,786 INFO L168 Benchmark]: TraceAbstraction took 8312.61 ms. Allocated memory was 251.1 MB in the beginning and 390.6 MB in the end (delta: 139.5 MB). Free memory was 209.9 MB in the beginning and 284.4 MB in the end (delta: -74.5 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:50,790 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.33 ms. Allocated memory is still 144.2 MB. Free memory is still 120.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.94 ms. Allocated memory was 144.2 MB in the beginning and 203.9 MB in the end (delta: 59.8 MB). Free memory was 99.4 MB in the beginning and 169.5 MB in the end (delta: -70.1 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.70 ms. Allocated memory is still 203.9 MB. Free memory was 169.5 MB in the beginning and 163.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.51 ms. Allocated memory is still 203.9 MB. Free memory was 163.9 MB in the beginning and 159.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2142.71 ms. Allocated memory was 203.9 MB in the beginning and 251.1 MB in the end (delta: 47.2 MB). Free memory was 159.0 MB in the beginning and 209.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8312.61 ms. Allocated memory was 251.1 MB in the beginning and 390.6 MB in the end (delta: 139.5 MB). Free memory was 209.9 MB in the beginning and 284.4 MB in the end (delta: -74.5 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: ((((((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || !(15 == a8)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a20 == 1) && !(1 == a7)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || !(15 == a8)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a20 == 1) && !(1 == a7)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 544 SDtfs, 1406 SDslu, 89 SDs, 0 SdLazy, 3546 SolverSat, 797 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 965 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 171 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9112 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1134 NumberOfCodeBlocks, 1134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1123 ConstructedInterpolants, 0 QuantifiedInterpolants, 660221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 439/439 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...