/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:55:17,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:55:17,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:55:17,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:55:17,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:55:17,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:55:17,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:55:17,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:55:17,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:55:17,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:55:17,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:55:17,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:55:17,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:55:17,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:55:17,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:55:17,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:55:17,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:55:17,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:55:17,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:55:17,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:55:17,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:55:17,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:55:17,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:55:17,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:55:17,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:55:17,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:55:17,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:55:17,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:55:17,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:55:17,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:55:17,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:55:17,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:55:17,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:55:17,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:55:17,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:55:17,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:55:17,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:55:17,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:55:17,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:55:17,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:55:17,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:55:17,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:55:17,307 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:55:17,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:55:17,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:55:17,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:55:17,309 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:55:17,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:55:17,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:55:17,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:55:17,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:55:17,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:55:17,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:55:17,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:55:17,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:55:17,311 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:55:17,311 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:55:17,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:55:17,311 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:55:17,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:55:17,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:55:17,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:55:17,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:55:17,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:55:17,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:55:17,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:55:17,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:55:17,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:55:17,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:55:17,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:55:17,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:55:17,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:55:17,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:55:17,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:55:17,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:55:17,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:55:17,608 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:55:17,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label13.c [2019-11-23 20:55:17,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d0be5e2/871c392a6e004ed794de2f4d9eb5dc30/FLAGca33aeba7 [2019-11-23 20:55:18,403 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:55:18,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label13.c [2019-11-23 20:55:18,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d0be5e2/871c392a6e004ed794de2f4d9eb5dc30/FLAGca33aeba7 [2019-11-23 20:55:18,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d0be5e2/871c392a6e004ed794de2f4d9eb5dc30 [2019-11-23 20:55:18,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:55:18,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:55:18,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:18,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:55:18,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:55:18,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:18" (1/1) ... [2019-11-23 20:55:18,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef52c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:18, skipping insertion in model container [2019-11-23 20:55:18,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:18" (1/1) ... [2019-11-23 20:55:18,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:55:18,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:55:19,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:19,409 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:55:19,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:19,744 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:55:19,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19 WrapperNode [2019-11-23 20:55:19,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:19,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:19,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:55:19,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:55:19,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:19,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:55:19,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:55:19,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:55:19,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:55:20,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:55:20,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:55:20,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:55:20,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (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 20:55:20,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:55:20,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:55:22,226 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:55:22,227 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:55:22,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:22 BoogieIcfgContainer [2019-11-23 20:55:22,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:55:22,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:55:22,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:55:22,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:55:22,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:55:18" (1/3) ... [2019-11-23 20:55:22,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54352300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:22, skipping insertion in model container [2019-11-23 20:55:22,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (2/3) ... [2019-11-23 20:55:22,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54352300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:22, skipping insertion in model container [2019-11-23 20:55:22,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:22" (3/3) ... [2019-11-23 20:55:22,238 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label13.c [2019-11-23 20:55:22,249 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:55:22,258 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:55:22,271 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:55:22,303 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:55:22,304 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:55:22,304 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:55:22,304 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:55:22,304 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:55:22,304 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:55:22,304 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:55:22,305 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:55:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:55:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 20:55:22,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:22,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:22,348 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash -233001789, now seen corresponding path program 1 times [2019-11-23 20:55:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75681506] [2019-11-23 20:55:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:23,137 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 20:55:23,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75681506] [2019-11-23 20:55:23,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:23,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:23,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569297547] [2019-11-23 20:55:23,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:23,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:23,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:23,165 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:55:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:25,397 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-11-23 20:55:25,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:25,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-23 20:55:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:25,453 INFO L225 Difference]: With dead ends: 1023 [2019-11-23 20:55:25,454 INFO L226 Difference]: Without dead ends: 654 [2019-11-23 20:55:25,459 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 20:55:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-11-23 20:55:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-11-23 20:55:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-23 20:55:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-11-23 20:55:25,544 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 155 [2019-11-23 20:55:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:25,545 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-11-23 20:55:25,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-11-23 20:55:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 20:55:25,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:25,551 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:25,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash 948456388, now seen corresponding path program 1 times [2019-11-23 20:55:25,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:25,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789914102] [2019-11-23 20:55:25,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:25,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789914102] [2019-11-23 20:55:25,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:25,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:25,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106958751] [2019-11-23 20:55:25,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:25,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:25,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:25,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:25,711 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-11-23 20:55:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:26,792 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-11-23 20:55:26,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:26,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 20:55:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:26,803 INFO L225 Difference]: With dead ends: 1929 [2019-11-23 20:55:26,803 INFO L226 Difference]: Without dead ends: 1279 [2019-11-23 20:55:26,809 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 20:55:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-23 20:55:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-11-23 20:55:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-23 20:55:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1831 transitions. [2019-11-23 20:55:26,878 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1831 transitions. Word has length 163 [2019-11-23 20:55:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:26,878 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1831 transitions. [2019-11-23 20:55:26,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1831 transitions. [2019-11-23 20:55:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 20:55:26,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:26,891 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:26,891 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:26,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1531262147, now seen corresponding path program 1 times [2019-11-23 20:55:26,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:26,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139013764] [2019-11-23 20:55:26,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:55:27,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139013764] [2019-11-23 20:55:27,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:27,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:27,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282096183] [2019-11-23 20:55:27,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:27,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:27,044 INFO L87 Difference]: Start difference. First operand 1265 states and 1831 transitions. Second operand 3 states. [2019-11-23 20:55:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:27,496 INFO L93 Difference]: Finished difference Result 3779 states and 5474 transitions. [2019-11-23 20:55:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:27,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 20:55:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:27,512 INFO L225 Difference]: With dead ends: 3779 [2019-11-23 20:55:27,513 INFO L226 Difference]: Without dead ends: 2516 [2019-11-23 20:55:27,516 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 20:55:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-11-23 20:55:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2513. [2019-11-23 20:55:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-11-23 20:55:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3630 transitions. [2019-11-23 20:55:27,617 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3630 transitions. Word has length 175 [2019-11-23 20:55:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:27,618 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3630 transitions. [2019-11-23 20:55:27,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3630 transitions. [2019-11-23 20:55:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-23 20:55:27,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:27,637 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:27,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:27,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:27,639 INFO L82 PathProgramCache]: Analyzing trace with hash -693789103, now seen corresponding path program 1 times [2019-11-23 20:55:27,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:27,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417529645] [2019-11-23 20:55:27,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:27,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417529645] [2019-11-23 20:55:27,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:27,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:27,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348990687] [2019-11-23 20:55:27,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:27,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:27,784 INFO L87 Difference]: Start difference. First operand 2513 states and 3630 transitions. Second operand 3 states. [2019-11-23 20:55:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:28,410 INFO L93 Difference]: Finished difference Result 4986 states and 7206 transitions. [2019-11-23 20:55:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:28,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-23 20:55:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:28,423 INFO L225 Difference]: With dead ends: 4986 [2019-11-23 20:55:28,423 INFO L226 Difference]: Without dead ends: 2475 [2019-11-23 20:55:28,427 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 20:55:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-11-23 20:55:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2019-11-23 20:55:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-11-23 20:55:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3502 transitions. [2019-11-23 20:55:28,492 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3502 transitions. Word has length 183 [2019-11-23 20:55:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:28,492 INFO L462 AbstractCegarLoop]: Abstraction has 2475 states and 3502 transitions. [2019-11-23 20:55:28,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3502 transitions. [2019-11-23 20:55:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-23 20:55:28,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:28,498 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:28,498 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1425017727, now seen corresponding path program 1 times [2019-11-23 20:55:28,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:28,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126524158] [2019-11-23 20:55:28,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:28,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126524158] [2019-11-23 20:55:28,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:28,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:28,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787772762] [2019-11-23 20:55:28,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:28,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:28,648 INFO L87 Difference]: Start difference. First operand 2475 states and 3502 transitions. Second operand 5 states. [2019-11-23 20:55:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:30,673 INFO L93 Difference]: Finished difference Result 5981 states and 8557 transitions. [2019-11-23 20:55:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:55:30,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-11-23 20:55:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:30,689 INFO L225 Difference]: With dead ends: 5981 [2019-11-23 20:55:30,689 INFO L226 Difference]: Without dead ends: 3508 [2019-11-23 20:55:30,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-11-23 20:55:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2881. [2019-11-23 20:55:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-11-23 20:55:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4092 transitions. [2019-11-23 20:55:30,756 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4092 transitions. Word has length 193 [2019-11-23 20:55:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:30,756 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 4092 transitions. [2019-11-23 20:55:30,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:55:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4092 transitions. [2019-11-23 20:55:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-23 20:55:30,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:30,763 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:30,763 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -228534605, now seen corresponding path program 1 times [2019-11-23 20:55:30,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:30,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315366089] [2019-11-23 20:55:30,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 20:55:30,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315366089] [2019-11-23 20:55:30,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805204927] [2019-11-23 20:55:30,862 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 20:55:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:31,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:31,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 20:55:31,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:31,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 20:55:31,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809671780] [2019-11-23 20:55:31,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:31,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:31,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:31,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:31,212 INFO L87 Difference]: Start difference. First operand 2881 states and 4092 transitions. Second operand 3 states. [2019-11-23 20:55:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:31,529 INFO L93 Difference]: Finished difference Result 8637 states and 12270 transitions. [2019-11-23 20:55:31,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:31,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-23 20:55:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:31,555 INFO L225 Difference]: With dead ends: 8637 [2019-11-23 20:55:31,556 INFO L226 Difference]: Without dead ends: 5758 [2019-11-23 20:55:31,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 227 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 20:55:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2019-11-23 20:55:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5756. [2019-11-23 20:55:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5756 states. [2019-11-23 20:55:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5756 states to 5756 states and 8155 transitions. [2019-11-23 20:55:31,668 INFO L78 Accepts]: Start accepts. Automaton has 5756 states and 8155 transitions. Word has length 227 [2019-11-23 20:55:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:31,668 INFO L462 AbstractCegarLoop]: Abstraction has 5756 states and 8155 transitions. [2019-11-23 20:55:31,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5756 states and 8155 transitions. [2019-11-23 20:55:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-23 20:55:31,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:31,677 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:31,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:31,891 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2051344667, now seen corresponding path program 1 times [2019-11-23 20:55:31,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:31,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533728916] [2019-11-23 20:55:31,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:32,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533728916] [2019-11-23 20:55:32,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:32,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:32,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788192662] [2019-11-23 20:55:32,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:32,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:32,024 INFO L87 Difference]: Start difference. First operand 5756 states and 8155 transitions. Second operand 3 states. [2019-11-23 20:55:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:33,017 INFO L93 Difference]: Finished difference Result 16806 states and 23749 transitions. [2019-11-23 20:55:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:33,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-11-23 20:55:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:33,064 INFO L225 Difference]: With dead ends: 16806 [2019-11-23 20:55:33,064 INFO L226 Difference]: Without dead ends: 11052 [2019-11-23 20:55:33,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11052 states. [2019-11-23 20:55:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11052 to 11048. [2019-11-23 20:55:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-11-23 20:55:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 14561 transitions. [2019-11-23 20:55:33,253 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 14561 transitions. Word has length 228 [2019-11-23 20:55:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:33,254 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 14561 transitions. [2019-11-23 20:55:33,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 14561 transitions. [2019-11-23 20:55:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 20:55:33,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:33,266 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, 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, 1, 1, 1, 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 20:55:33,267 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash -119863615, now seen corresponding path program 1 times [2019-11-23 20:55:33,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:33,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064448901] [2019-11-23 20:55:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:33,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064448901] [2019-11-23 20:55:33,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:33,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:33,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020010273] [2019-11-23 20:55:33,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:33,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:33,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:33,425 INFO L87 Difference]: Start difference. First operand 11048 states and 14561 transitions. Second operand 4 states. [2019-11-23 20:55:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:35,306 INFO L93 Difference]: Finished difference Result 38774 states and 50859 transitions. [2019-11-23 20:55:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:35,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-23 20:55:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:35,363 INFO L225 Difference]: With dead ends: 38774 [2019-11-23 20:55:35,364 INFO L226 Difference]: Without dead ends: 27728 [2019-11-23 20:55:35,380 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 20:55:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27728 states. [2019-11-23 20:55:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27728 to 20792. [2019-11-23 20:55:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-11-23 20:55:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 26369 transitions. [2019-11-23 20:55:35,721 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 26369 transitions. Word has length 233 [2019-11-23 20:55:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:35,722 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 26369 transitions. [2019-11-23 20:55:35,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 26369 transitions. [2019-11-23 20:55:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-23 20:55:35,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:35,743 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:35,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 290577497, now seen corresponding path program 1 times [2019-11-23 20:55:35,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:35,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83558718] [2019-11-23 20:55:35,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 20:55:35,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83558718] [2019-11-23 20:55:35,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:35,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:35,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646449281] [2019-11-23 20:55:35,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:35,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:35,842 INFO L87 Difference]: Start difference. First operand 20792 states and 26369 transitions. Second operand 3 states. [2019-11-23 20:55:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:37,066 INFO L93 Difference]: Finished difference Result 41590 states and 52750 transitions. [2019-11-23 20:55:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:37,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-11-23 20:55:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:37,103 INFO L225 Difference]: With dead ends: 41590 [2019-11-23 20:55:37,103 INFO L226 Difference]: Without dead ends: 20800 [2019-11-23 20:55:37,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 20:55:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20800 states. [2019-11-23 20:55:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20800 to 20792. [2019-11-23 20:55:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-11-23 20:55:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 24490 transitions. [2019-11-23 20:55:37,406 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 24490 transitions. Word has length 234 [2019-11-23 20:55:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:37,406 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 24490 transitions. [2019-11-23 20:55:37,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 24490 transitions. [2019-11-23 20:55:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-23 20:55:37,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:37,425 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:37,425 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:37,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:37,426 INFO L82 PathProgramCache]: Analyzing trace with hash 197872955, now seen corresponding path program 1 times [2019-11-23 20:55:37,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:37,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534682355] [2019-11-23 20:55:37,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:37,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534682355] [2019-11-23 20:55:37,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:37,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:37,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454154894] [2019-11-23 20:55:37,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:37,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:37,596 INFO L87 Difference]: Start difference. First operand 20792 states and 24490 transitions. Second operand 4 states. [2019-11-23 20:55:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:38,949 INFO L93 Difference]: Finished difference Result 41176 states and 48520 transitions. [2019-11-23 20:55:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:38,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-23 20:55:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:38,967 INFO L225 Difference]: With dead ends: 41176 [2019-11-23 20:55:38,967 INFO L226 Difference]: Without dead ends: 20386 [2019-11-23 20:55:38,987 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 20:55:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20386 states. [2019-11-23 20:55:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20386 to 20386. [2019-11-23 20:55:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20386 states. [2019-11-23 20:55:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20386 states to 20386 states and 23030 transitions. [2019-11-23 20:55:39,249 INFO L78 Accepts]: Start accepts. Automaton has 20386 states and 23030 transitions. Word has length 243 [2019-11-23 20:55:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:39,249 INFO L462 AbstractCegarLoop]: Abstraction has 20386 states and 23030 transitions. [2019-11-23 20:55:39,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 20386 states and 23030 transitions. [2019-11-23 20:55:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-23 20:55:39,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:39,263 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:39,263 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1772912823, now seen corresponding path program 1 times [2019-11-23 20:55:39,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:39,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58392743] [2019-11-23 20:55:39,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:39,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58392743] [2019-11-23 20:55:39,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167273303] [2019-11-23 20:55:39,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:39,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:55:39,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:40,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:40,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-23 20:55:40,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908353414] [2019-11-23 20:55:40,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:40,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:40,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:40,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:55:40,450 INFO L87 Difference]: Start difference. First operand 20386 states and 23030 transitions. Second operand 3 states. [2019-11-23 20:55:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:41,583 INFO L93 Difference]: Finished difference Result 55410 states and 62379 transitions. [2019-11-23 20:55:41,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:41,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-23 20:55:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:41,618 INFO L225 Difference]: With dead ends: 55410 [2019-11-23 20:55:41,618 INFO L226 Difference]: Without dead ends: 35026 [2019-11-23 20:55:41,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:55:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35026 states. [2019-11-23 20:55:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35026 to 35014. [2019-11-23 20:55:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35014 states. [2019-11-23 20:55:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35014 states to 35014 states and 38737 transitions. [2019-11-23 20:55:42,149 INFO L78 Accepts]: Start accepts. Automaton has 35014 states and 38737 transitions. Word has length 248 [2019-11-23 20:55:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:42,150 INFO L462 AbstractCegarLoop]: Abstraction has 35014 states and 38737 transitions. [2019-11-23 20:55:42,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 35014 states and 38737 transitions. [2019-11-23 20:55:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-23 20:55:42,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:42,168 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:42,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:42,373 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:42,374 INFO L82 PathProgramCache]: Analyzing trace with hash 309467600, now seen corresponding path program 1 times [2019-11-23 20:55:42,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:42,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316217277] [2019-11-23 20:55:42,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-23 20:55:42,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316217277] [2019-11-23 20:55:42,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:42,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:42,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745245947] [2019-11-23 20:55:42,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:42,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:42,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:42,598 INFO L87 Difference]: Start difference. First operand 35014 states and 38737 transitions. Second operand 4 states. [2019-11-23 20:55:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:44,623 INFO L93 Difference]: Finished difference Result 130473 states and 144639 transitions. [2019-11-23 20:55:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:44,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-11-23 20:55:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:44,714 INFO L225 Difference]: With dead ends: 130473 [2019-11-23 20:55:44,714 INFO L226 Difference]: Without dead ends: 95461 [2019-11-23 20:55:44,751 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 20:55:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95461 states. [2019-11-23 20:55:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95461 to 95457. [2019-11-23 20:55:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95457 states. [2019-11-23 20:55:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95457 states to 95457 states and 105682 transitions. [2019-11-23 20:55:46,689 INFO L78 Accepts]: Start accepts. Automaton has 95457 states and 105682 transitions. Word has length 255 [2019-11-23 20:55:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:46,689 INFO L462 AbstractCegarLoop]: Abstraction has 95457 states and 105682 transitions. [2019-11-23 20:55:46,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 95457 states and 105682 transitions. [2019-11-23 20:55:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-23 20:55:46,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:46,703 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:46,704 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1285532914, now seen corresponding path program 1 times [2019-11-23 20:55:46,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:46,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846063621] [2019-11-23 20:55:46,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-23 20:55:47,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846063621] [2019-11-23 20:55:47,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:47,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:47,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198847995] [2019-11-23 20:55:47,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:47,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:47,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:47,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:47,190 INFO L87 Difference]: Start difference. First operand 95457 states and 105682 transitions. Second operand 3 states. [2019-11-23 20:55:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:48,686 INFO L93 Difference]: Finished difference Result 234303 states and 259754 transitions. [2019-11-23 20:55:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:48,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-11-23 20:55:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:48,806 INFO L225 Difference]: With dead ends: 234303 [2019-11-23 20:55:48,806 INFO L226 Difference]: Without dead ends: 138848 [2019-11-23 20:55:48,858 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 20:55:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138848 states. [2019-11-23 20:55:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138848 to 138830. [2019-11-23 20:55:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138830 states. [2019-11-23 20:55:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138830 states to 138830 states and 153915 transitions. [2019-11-23 20:55:52,486 INFO L78 Accepts]: Start accepts. Automaton has 138830 states and 153915 transitions. Word has length 290 [2019-11-23 20:55:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:52,487 INFO L462 AbstractCegarLoop]: Abstraction has 138830 states and 153915 transitions. [2019-11-23 20:55:52,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 138830 states and 153915 transitions. [2019-11-23 20:55:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-23 20:55:52,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:52,505 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:52,505 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash -409825543, now seen corresponding path program 1 times [2019-11-23 20:55:52,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:52,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960440476] [2019-11-23 20:55:52,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-23 20:55:52,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960440476] [2019-11-23 20:55:52,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469991818] [2019-11-23 20:55:52,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:52,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:52,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:55:52,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:52,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-23 20:55:52,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64180017] [2019-11-23 20:55:52,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:52,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:52,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:52,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:52,876 INFO L87 Difference]: Start difference. First operand 138830 states and 153915 transitions. Second operand 3 states. [2019-11-23 20:55:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:56,520 INFO L93 Difference]: Finished difference Result 276870 states and 307022 transitions. [2019-11-23 20:55:56,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:56,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-11-23 20:55:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:56,698 INFO L225 Difference]: With dead ends: 276870 [2019-11-23 20:55:56,698 INFO L226 Difference]: Without dead ends: 138042 [2019-11-23 20:55:56,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138042 states. [2019-11-23 20:55:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138042 to 134364. [2019-11-23 20:55:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134364 states. [2019-11-23 20:55:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134364 states to 134364 states and 147439 transitions. [2019-11-23 20:55:58,182 INFO L78 Accepts]: Start accepts. Automaton has 134364 states and 147439 transitions. Word has length 297 [2019-11-23 20:55:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:58,182 INFO L462 AbstractCegarLoop]: Abstraction has 134364 states and 147439 transitions. [2019-11-23 20:55:58,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 134364 states and 147439 transitions. [2019-11-23 20:55:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-23 20:55:58,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:58,196 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:58,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:58,397 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash -46403431, now seen corresponding path program 1 times [2019-11-23 20:55:58,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:58,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719406838] [2019-11-23 20:55:58,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-23 20:55:58,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719406838] [2019-11-23 20:55:58,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:58,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:58,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830371267] [2019-11-23 20:55:58,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:58,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:58,593 INFO L87 Difference]: Start difference. First operand 134364 states and 147439 transitions. Second operand 5 states. [2019-11-23 20:56:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:01,371 INFO L93 Difference]: Finished difference Result 364039 states and 396948 transitions. [2019-11-23 20:56:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:56:01,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 297 [2019-11-23 20:56:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:01,586 INFO L225 Difference]: With dead ends: 364039 [2019-11-23 20:56:01,587 INFO L226 Difference]: Without dead ends: 229677 [2019-11-23 20:56:01,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:56:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229677 states. [2019-11-23 20:56:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229677 to 222727. [2019-11-23 20:56:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222727 states. [2019-11-23 20:56:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222727 states to 222727 states and 242038 transitions. [2019-11-23 20:56:08,971 INFO L78 Accepts]: Start accepts. Automaton has 222727 states and 242038 transitions. Word has length 297 [2019-11-23 20:56:08,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:08,971 INFO L462 AbstractCegarLoop]: Abstraction has 222727 states and 242038 transitions. [2019-11-23 20:56:08,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:56:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 222727 states and 242038 transitions. [2019-11-23 20:56:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-23 20:56:08,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:08,993 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:08,993 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:08,994 INFO L82 PathProgramCache]: Analyzing trace with hash 412106052, now seen corresponding path program 1 times [2019-11-23 20:56:08,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:08,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291362172] [2019-11-23 20:56:08,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 20:56:09,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291362172] [2019-11-23 20:56:09,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:09,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:09,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336217303] [2019-11-23 20:56:09,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:09,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:09,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:09,165 INFO L87 Difference]: Start difference. First operand 222727 states and 242038 transitions. Second operand 4 states. [2019-11-23 20:56:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:12,266 INFO L93 Difference]: Finished difference Result 525849 states and 573497 transitions. [2019-11-23 20:56:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:12,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-11-23 20:56:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:12,553 INFO L225 Difference]: With dead ends: 525849 [2019-11-23 20:56:12,553 INFO L226 Difference]: Without dead ends: 303124 [2019-11-23 20:56:12,622 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 20:56:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303124 states. [2019-11-23 20:56:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303124 to 235719. [2019-11-23 20:56:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235719 states. [2019-11-23 20:56:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235719 states to 235719 states and 256888 transitions. [2019-11-23 20:56:21,088 INFO L78 Accepts]: Start accepts. Automaton has 235719 states and 256888 transitions. Word has length 309 [2019-11-23 20:56:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:21,088 INFO L462 AbstractCegarLoop]: Abstraction has 235719 states and 256888 transitions. [2019-11-23 20:56:21,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 235719 states and 256888 transitions. [2019-11-23 20:56:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-23 20:56:21,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:21,114 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:21,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash -516813484, now seen corresponding path program 1 times [2019-11-23 20:56:21,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:21,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39296587] [2019-11-23 20:56:21,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 20:56:21,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39296587] [2019-11-23 20:56:21,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:21,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:21,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298401269] [2019-11-23 20:56:21,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:21,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:21,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:21,299 INFO L87 Difference]: Start difference. First operand 235719 states and 256888 transitions. Second operand 3 states. [2019-11-23 20:56:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:23,308 INFO L93 Difference]: Finished difference Result 471006 states and 513260 transitions. [2019-11-23 20:56:23,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:23,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-23 20:56:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:23,532 INFO L225 Difference]: With dead ends: 471006 [2019-11-23 20:56:23,532 INFO L226 Difference]: Without dead ends: 235289 [2019-11-23 20:56:23,584 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 20:56:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235289 states.