/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_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:56:38,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:56:38,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:56:38,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:56:38,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:56:38,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:56:38,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:56:38,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:56:38,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:56:38,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:56:38,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:56:38,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:56:38,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:56:38,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:56:38,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:56:38,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:56:38,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:56:38,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:56:38,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:56:38,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:56:38,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:56:38,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:56:38,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:56:38,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:56:38,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:56:38,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:56:38,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:56:38,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:56:38,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:56:38,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:56:38,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:56:38,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:56:38,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:56:38,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:56:38,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:56:38,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:56:38,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:56:38,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:56:38,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:56:38,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:56:38,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:56:38,428 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:56:38,442 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:56:38,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:56:38,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:56:38,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:56:38,444 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:56:38,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:56:38,444 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:56:38,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:56:38,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:56:38,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:56:38,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:56:38,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:56:38,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:56:38,446 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:56:38,446 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:56:38,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:56:38,446 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:56:38,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:56:38,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:56:38,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:56:38,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:56:38,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:56:38,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:56:38,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:56:38,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:56:38,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:56:38,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:56:38,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:56:38,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:56:38,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:56:38,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:56:38,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:56:38,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:56:38,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:56:38,752 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:56:38,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label45.c [2019-11-23 20:56:38,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608822135/5743cc012d544ea9a0a4b31ee8b68de0/FLAG33fbb90d0 [2019-11-23 20:56:39,528 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:56:39,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label45.c [2019-11-23 20:56:39,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608822135/5743cc012d544ea9a0a4b31ee8b68de0/FLAG33fbb90d0 [2019-11-23 20:56:39,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608822135/5743cc012d544ea9a0a4b31ee8b68de0 [2019-11-23 20:56:39,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:56:39,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:56:39,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:39,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:56:39,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:56:39,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:39" (1/1) ... [2019-11-23 20:56:39,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fae2f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:39, skipping insertion in model container [2019-11-23 20:56:39,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:56:39" (1/1) ... [2019-11-23 20:56:39,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:56:39,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:56:40,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:40,630 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:56:40,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:56:41,015 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:56:41,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41 WrapperNode [2019-11-23 20:56:41,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:56:41,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:41,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:56:41,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:56:41,035 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:56:41" (1/1) ... [2019-11-23 20:56:41,087 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:56:41" (1/1) ... [2019-11-23 20:56:41,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:56:41,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:56:41,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:56:41,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:56:41,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (1/1) ... [2019-11-23 20:56:41,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (1/1) ... [2019-11-23 20:56:41,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (1/1) ... [2019-11-23 20:56:41,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (1/1) ... [2019-11-23 20:56:41,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (1/1) ... [2019-11-23 20:56:41,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (1/1) ... [2019-11-23 20:56:41,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (1/1) ... [2019-11-23 20:56:41,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:56:41,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:56:41,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:56:41,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:56:41,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (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:56:41,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:56:41,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:56:43,448 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:56:43,449 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:56:43,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:43 BoogieIcfgContainer [2019-11-23 20:56:43,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:56:43,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:56:43,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:56:43,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:56:43,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:56:39" (1/3) ... [2019-11-23 20:56:43,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397aead6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:43, skipping insertion in model container [2019-11-23 20:56:43,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:56:41" (2/3) ... [2019-11-23 20:56:43,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397aead6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:56:43, skipping insertion in model container [2019-11-23 20:56:43,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:56:43" (3/3) ... [2019-11-23 20:56:43,463 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label45.c [2019-11-23 20:56:43,475 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:56:43,486 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:56:43,499 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:56:43,551 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:56:43,551 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:56:43,551 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:56:43,551 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:56:43,552 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:56:43,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:56:43,553 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:56:43,553 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:56:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:56:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 20:56:43,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:43,602 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] [2019-11-23 20:56:43,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1107694590, now seen corresponding path program 1 times [2019-11-23 20:56:43,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:43,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295481716] [2019-11-23 20:56:43,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:44,317 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:56:44,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295481716] [2019-11-23 20:56:44,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:44,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:44,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635888620] [2019-11-23 20:56:44,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:44,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:44,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:44,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:44,350 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:56:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:46,690 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-11-23 20:56:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:46,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-23 20:56:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:46,714 INFO L225 Difference]: With dead ends: 1068 [2019-11-23 20:56:46,715 INFO L226 Difference]: Without dead ends: 670 [2019-11-23 20:56:46,720 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:56:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-23 20:56:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-11-23 20:56:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-23 20:56:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-11-23 20:56:46,814 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 144 [2019-11-23 20:56:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:46,816 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-11-23 20:56:46,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-11-23 20:56:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 20:56:46,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:46,821 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,821 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:46,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:46,822 INFO L82 PathProgramCache]: Analyzing trace with hash 930993362, now seen corresponding path program 1 times [2019-11-23 20:56:46,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:46,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449468722] [2019-11-23 20:56:46,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:46,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449468722] [2019-11-23 20:56:46,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:46,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:46,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36942727] [2019-11-23 20:56:46,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:46,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:46,970 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-11-23 20:56:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:48,790 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-11-23 20:56:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:48,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-23 20:56:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:48,798 INFO L225 Difference]: With dead ends: 1762 [2019-11-23 20:56:48,798 INFO L226 Difference]: Without dead ends: 1308 [2019-11-23 20:56:48,802 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:56:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-23 20:56:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-11-23 20:56:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-23 20:56:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-11-23 20:56:48,840 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 149 [2019-11-23 20:56:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:48,840 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-11-23 20:56:48,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-11-23 20:56:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 20:56:48,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:48,846 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] [2019-11-23 20:56:48,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:48,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:48,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1317297247, now seen corresponding path program 1 times [2019-11-23 20:56:48,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:48,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954367553] [2019-11-23 20:56:48,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:48,966 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:56:48,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954367553] [2019-11-23 20:56:48,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:48,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:48,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620596732] [2019-11-23 20:56:48,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:48,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:48,971 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-11-23 20:56:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:50,071 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-11-23 20:56:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:50,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 20:56:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:50,087 INFO L225 Difference]: With dead ends: 2567 [2019-11-23 20:56:50,087 INFO L226 Difference]: Without dead ends: 1700 [2019-11-23 20:56:50,089 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:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-23 20:56:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-11-23 20:56:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-23 20:56:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-11-23 20:56:50,127 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 152 [2019-11-23 20:56:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:50,128 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-11-23 20:56:50,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-11-23 20:56:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 20:56:50,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:50,133 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,133 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:50,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1093012680, now seen corresponding path program 1 times [2019-11-23 20:56:50,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:50,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387088850] [2019-11-23 20:56:50,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:56:50,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387088850] [2019-11-23 20:56:50,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:50,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:50,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409130607] [2019-11-23 20:56:50,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:50,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:50,214 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-11-23 20:56:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:51,350 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-11-23 20:56:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:51,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 20:56:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:51,364 INFO L225 Difference]: With dead ends: 4189 [2019-11-23 20:56:51,364 INFO L226 Difference]: Without dead ends: 2508 [2019-11-23 20:56:51,367 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:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-23 20:56:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-11-23 20:56:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-11-23 20:56:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-11-23 20:56:51,417 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 159 [2019-11-23 20:56:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:51,417 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-11-23 20:56:51,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-11-23 20:56:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 20:56:51,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:51,423 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] [2019-11-23 20:56:51,423 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1874728392, now seen corresponding path program 1 times [2019-11-23 20:56:51,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:51,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073872612] [2019-11-23 20:56:51,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:51,544 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:56:51,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073872612] [2019-11-23 20:56:51,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:51,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:56:51,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283706777] [2019-11-23 20:56:51,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:51,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:51,549 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-11-23 20:56:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:52,050 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-11-23 20:56:52,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:52,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 20:56:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:52,076 INFO L225 Difference]: With dead ends: 7497 [2019-11-23 20:56:52,076 INFO L226 Difference]: Without dead ends: 4992 [2019-11-23 20:56:52,083 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:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-11-23 20:56:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-11-23 20:56:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-23 20:56:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-11-23 20:56:52,221 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 164 [2019-11-23 20:56:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:52,221 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-11-23 20:56:52,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-11-23 20:56:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 20:56:52,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:52,233 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,233 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash 973142556, now seen corresponding path program 1 times [2019-11-23 20:56:52,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:52,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288806575] [2019-11-23 20:56:52,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:56:52,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288806575] [2019-11-23 20:56:52,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891705768] [2019-11-23 20:56:52,375 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:56:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:52,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:52,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:56:52,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:52,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 20:56:52,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404723121] [2019-11-23 20:56:52,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:52,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:52,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:52,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:52,607 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-11-23 20:56:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:52,991 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-11-23 20:56:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:52,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 20:56:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:53,037 INFO L225 Difference]: With dead ends: 14957 [2019-11-23 20:56:53,037 INFO L226 Difference]: Without dead ends: 9970 [2019-11-23 20:56:53,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 173 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:56:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-11-23 20:56:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-11-23 20:56:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-11-23 20:56:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-11-23 20:56:53,321 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 173 [2019-11-23 20:56:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:53,322 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-11-23 20:56:53,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-11-23 20:56:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 20:56:53,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:53,335 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] [2019-11-23 20:56:53,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:53,543 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash 437152454, now seen corresponding path program 1 times [2019-11-23 20:56:53,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:53,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324042842] [2019-11-23 20:56:53,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:53,683 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:56:53,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324042842] [2019-11-23 20:56:53,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:53,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:56:53,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084032307] [2019-11-23 20:56:53,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:56:53,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:53,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:56:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:56:53,687 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-11-23 20:56:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:55,910 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-11-23 20:56:55,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:56:55,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-11-23 20:56:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:55,972 INFO L225 Difference]: With dead ends: 22448 [2019-11-23 20:56:55,972 INFO L226 Difference]: Without dead ends: 12482 [2019-11-23 20:56:55,986 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:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-11-23 20:56:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-11-23 20:56:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-23 20:56:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-11-23 20:56:56,184 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 182 [2019-11-23 20:56:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:56,187 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-11-23 20:56:56,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:56:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-11-23 20:56:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 20:56:56,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:56,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,203 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2024489893, now seen corresponding path program 1 times [2019-11-23 20:56:56,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:56,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455155502] [2019-11-23 20:56:56,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:56,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455155502] [2019-11-23 20:56:56,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:56,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:56,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127423867] [2019-11-23 20:56:56,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:56,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:56,306 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-11-23 20:56:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:57,538 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-11-23 20:56:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:57,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-23 20:56:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:57,566 INFO L225 Difference]: With dead ends: 21582 [2019-11-23 20:56:57,567 INFO L226 Difference]: Without dead ends: 10804 [2019-11-23 20:56:57,581 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:56:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-11-23 20:56:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-11-23 20:56:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-23 20:56:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-11-23 20:56:57,776 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 182 [2019-11-23 20:56:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:57,776 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-11-23 20:56:57,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-11-23 20:56:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 20:56:57,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:57,794 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:56:57,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash -876483858, now seen corresponding path program 1 times [2019-11-23 20:56:57,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:57,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076585460] [2019-11-23 20:56:57,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 20:56:57,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076585460] [2019-11-23 20:56:57,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:57,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:57,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787434670] [2019-11-23 20:56:57,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:57,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:57,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:57,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:57,905 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-11-23 20:56:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:59,724 INFO L93 Difference]: Finished difference Result 39484 states and 52680 transitions. [2019-11-23 20:56:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:59,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-23 20:56:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:59,771 INFO L225 Difference]: With dead ends: 39484 [2019-11-23 20:56:59,771 INFO L226 Difference]: Without dead ends: 28706 [2019-11-23 20:56:59,785 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:56:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28706 states. [2019-11-23 20:57:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28706 to 20132. [2019-11-23 20:57:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-11-23 20:57:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26029 transitions. [2019-11-23 20:57:00,106 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26029 transitions. Word has length 182 [2019-11-23 20:57:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:00,107 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26029 transitions. [2019-11-23 20:57:00,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26029 transitions. [2019-11-23 20:57:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 20:57:00,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:00,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,128 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1689276045, now seen corresponding path program 1 times [2019-11-23 20:57:00,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:00,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533792477] [2019-11-23 20:57:00,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-23 20:57:00,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533792477] [2019-11-23 20:57:00,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:00,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:00,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267907427] [2019-11-23 20:57:00,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:00,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:00,205 INFO L87 Difference]: Start difference. First operand 20132 states and 26029 transitions. Second operand 3 states. [2019-11-23 20:57:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:01,401 INFO L93 Difference]: Finished difference Result 55495 states and 71447 transitions. [2019-11-23 20:57:01,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:01,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-23 20:57:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:01,457 INFO L225 Difference]: With dead ends: 55495 [2019-11-23 20:57:01,462 INFO L226 Difference]: Without dead ends: 35365 [2019-11-23 20:57:01,496 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:57:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-11-23 20:57:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-11-23 20:57:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-11-23 20:57:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41636 transitions. [2019-11-23 20:57:02,766 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41636 transitions. Word has length 188 [2019-11-23 20:57:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:02,766 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41636 transitions. [2019-11-23 20:57:02,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41636 transitions. [2019-11-23 20:57:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-23 20:57:02,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:02,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,793 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:02,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1420082969, now seen corresponding path program 1 times [2019-11-23 20:57:02,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:02,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328100425] [2019-11-23 20:57:02,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:02,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328100425] [2019-11-23 20:57:02,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:02,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:02,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985730242] [2019-11-23 20:57:02,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:02,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:02,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:02,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:02,905 INFO L87 Difference]: Start difference. First operand 35357 states and 41636 transitions. Second operand 4 states. [2019-11-23 20:57:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:04,900 INFO L93 Difference]: Finished difference Result 83915 states and 100059 transitions. [2019-11-23 20:57:04,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:04,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-23 20:57:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:04,951 INFO L225 Difference]: With dead ends: 83915 [2019-11-23 20:57:04,951 INFO L226 Difference]: Without dead ends: 48560 [2019-11-23 20:57:04,973 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:57:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48560 states. [2019-11-23 20:57:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48560 to 48552. [2019-11-23 20:57:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48552 states. [2019-11-23 20:57:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48552 states to 48552 states and 55757 transitions. [2019-11-23 20:57:05,606 INFO L78 Accepts]: Start accepts. Automaton has 48552 states and 55757 transitions. Word has length 199 [2019-11-23 20:57:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:05,606 INFO L462 AbstractCegarLoop]: Abstraction has 48552 states and 55757 transitions. [2019-11-23 20:57:05,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 48552 states and 55757 transitions. [2019-11-23 20:57:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-23 20:57:05,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:05,633 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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:57:05,633 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1323852000, now seen corresponding path program 1 times [2019-11-23 20:57:05,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:05,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472228548] [2019-11-23 20:57:05,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:57:05,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472228548] [2019-11-23 20:57:05,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:05,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:05,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898865617] [2019-11-23 20:57:05,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:05,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:05,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:05,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:05,773 INFO L87 Difference]: Start difference. First operand 48552 states and 55757 transitions. Second operand 3 states. [2019-11-23 20:57:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:07,569 INFO L93 Difference]: Finished difference Result 96192 states and 110404 transitions. [2019-11-23 20:57:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:07,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-23 20:57:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:07,608 INFO L225 Difference]: With dead ends: 96192 [2019-11-23 20:57:07,608 INFO L226 Difference]: Without dead ends: 47642 [2019-11-23 20:57:07,627 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:57:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47642 states. [2019-11-23 20:57:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47642 to 47642. [2019-11-23 20:57:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47642 states. [2019-11-23 20:57:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47642 states to 47642 states and 54149 transitions. [2019-11-23 20:57:08,117 INFO L78 Accepts]: Start accepts. Automaton has 47642 states and 54149 transitions. Word has length 231 [2019-11-23 20:57:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:08,117 INFO L462 AbstractCegarLoop]: Abstraction has 47642 states and 54149 transitions. [2019-11-23 20:57:08,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 47642 states and 54149 transitions. [2019-11-23 20:57:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-23 20:57:08,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:08,134 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 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] [2019-11-23 20:57:08,135 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash -674330304, now seen corresponding path program 1 times [2019-11-23 20:57:08,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:08,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078137933] [2019-11-23 20:57:08,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-23 20:57:08,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078137933] [2019-11-23 20:57:08,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:08,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:08,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604928350] [2019-11-23 20:57:08,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:08,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:08,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:08,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:08,291 INFO L87 Difference]: Start difference. First operand 47642 states and 54149 transitions. Second operand 4 states. [2019-11-23 20:57:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:10,169 INFO L93 Difference]: Finished difference Result 130674 states and 148946 transitions. [2019-11-23 20:57:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:10,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-11-23 20:57:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:10,244 INFO L225 Difference]: With dead ends: 130674 [2019-11-23 20:57:10,244 INFO L226 Difference]: Without dead ends: 83034 [2019-11-23 20:57:10,271 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:57:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83034 states. [2019-11-23 20:57:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83034 to 60228. [2019-11-23 20:57:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60228 states. [2019-11-23 20:57:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60228 states to 60228 states and 69017 transitions. [2019-11-23 20:57:10,879 INFO L78 Accepts]: Start accepts. Automaton has 60228 states and 69017 transitions. Word has length 242 [2019-11-23 20:57:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:10,879 INFO L462 AbstractCegarLoop]: Abstraction has 60228 states and 69017 transitions. [2019-11-23 20:57:10,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 60228 states and 69017 transitions. [2019-11-23 20:57:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-23 20:57:10,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:10,895 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:57:10,895 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash -191950430, now seen corresponding path program 1 times [2019-11-23 20:57:10,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:10,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92211252] [2019-11-23 20:57:10,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 20:57:11,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92211252] [2019-11-23 20:57:11,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:11,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:11,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46454004] [2019-11-23 20:57:11,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:11,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:11,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:11,304 INFO L87 Difference]: Start difference. First operand 60228 states and 69017 transitions. Second operand 3 states. [2019-11-23 20:57:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:11,995 INFO L93 Difference]: Finished difference Result 120446 states and 138024 transitions. [2019-11-23 20:57:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:11,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-23 20:57:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:12,045 INFO L225 Difference]: With dead ends: 120446 [2019-11-23 20:57:12,045 INFO L226 Difference]: Without dead ends: 60220 [2019-11-23 20:57:12,071 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:57:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60220 states. [2019-11-23 20:57:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60220 to 60220. [2019-11-23 20:57:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60220 states. [2019-11-23 20:57:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60220 states to 60220 states and 69001 transitions. [2019-11-23 20:57:12,588 INFO L78 Accepts]: Start accepts. Automaton has 60220 states and 69001 transitions. Word has length 269 [2019-11-23 20:57:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:12,589 INFO L462 AbstractCegarLoop]: Abstraction has 60220 states and 69001 transitions. [2019-11-23 20:57:12,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 60220 states and 69001 transitions. [2019-11-23 20:57:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-23 20:57:13,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:13,820 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, 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, 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:57:13,820 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash -572198046, now seen corresponding path program 1 times [2019-11-23 20:57:13,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:13,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607280409] [2019-11-23 20:57:13,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 20:57:13,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607280409] [2019-11-23 20:57:13,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664019988] [2019-11-23 20:57:13,986 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:57:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:14,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:14,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 20:57:14,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:14,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:57:14,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595065211] [2019-11-23 20:57:14,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:14,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:14,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:14,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:14,221 INFO L87 Difference]: Start difference. First operand 60220 states and 69001 transitions. Second operand 3 states. [2019-11-23 20:57:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:15,446 INFO L93 Difference]: Finished difference Result 123720 states and 141403 transitions. [2019-11-23 20:57:15,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:15,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-11-23 20:57:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:15,499 INFO L225 Difference]: With dead ends: 123720 [2019-11-23 20:57:15,499 INFO L226 Difference]: Without dead ends: 63502 [2019-11-23 20:57:15,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 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:57:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63502 states. [2019-11-23 20:57:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63502 to 63468. [2019-11-23 20:57:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63468 states. [2019-11-23 20:57:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63468 states to 63468 states and 71548 transitions. [2019-11-23 20:57:16,187 INFO L78 Accepts]: Start accepts. Automaton has 63468 states and 71548 transitions. Word has length 275 [2019-11-23 20:57:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:16,187 INFO L462 AbstractCegarLoop]: Abstraction has 63468 states and 71548 transitions. [2019-11-23 20:57:16,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 63468 states and 71548 transitions. [2019-11-23 20:57:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-11-23 20:57:16,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:16,206 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 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] [2019-11-23 20:57:16,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:16,411 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1216392786, now seen corresponding path program 1 times [2019-11-23 20:57:16,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:16,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866711753] [2019-11-23 20:57:16,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:16,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866711753] [2019-11-23 20:57:16,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:16,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:57:16,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927062192] [2019-11-23 20:57:16,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:16,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:16,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:16,698 INFO L87 Difference]: Start difference. First operand 63468 states and 71548 transitions. Second operand 4 states. [2019-11-23 20:57:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:17,603 INFO L93 Difference]: Finished difference Result 233524 states and 263465 transitions. [2019-11-23 20:57:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:17,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2019-11-23 20:57:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:17,772 INFO L225 Difference]: With dead ends: 233524 [2019-11-23 20:57:17,772 INFO L226 Difference]: Without dead ends: 170058 [2019-11-23 20:57:17,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170058 states. [2019-11-23 20:57:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170058 to 114107. [2019-11-23 20:57:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114107 states. [2019-11-23 20:57:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114107 states to 114107 states and 128825 transitions. [2019-11-23 20:57:19,490 INFO L78 Accepts]: Start accepts. Automaton has 114107 states and 128825 transitions. Word has length 285 [2019-11-23 20:57:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:19,490 INFO L462 AbstractCegarLoop]: Abstraction has 114107 states and 128825 transitions. [2019-11-23 20:57:19,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 114107 states and 128825 transitions. [2019-11-23 20:57:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-23 20:57:19,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:19,507 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:57:19,507 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:19,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash 728940600, now seen corresponding path program 1 times [2019-11-23 20:57:19,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:19,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194854311] [2019-11-23 20:57:19,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:19,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194854311] [2019-11-23 20:57:19,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:19,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:57:19,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904490581] [2019-11-23 20:57:19,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:19,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:19,780 INFO L87 Difference]: Start difference. First operand 114107 states and 128825 transitions. Second operand 4 states. [2019-11-23 20:57:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:22,028 INFO L93 Difference]: Finished difference Result 226585 states and 255777 transitions. [2019-11-23 20:57:22,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:22,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-23 20:57:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:22,138 INFO L225 Difference]: With dead ends: 226585 [2019-11-23 20:57:22,138 INFO L226 Difference]: Without dead ends: 112480 [2019-11-23 20:57:22,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:57:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112480 states. [2019-11-23 20:57:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112480 to 110844. [2019-11-23 20:57:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110844 states. [2019-11-23 20:57:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110844 states to 110844 states and 124116 transitions. [2019-11-23 20:57:25,720 INFO L78 Accepts]: Start accepts. Automaton has 110844 states and 124116 transitions. Word has length 291 [2019-11-23 20:57:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:25,721 INFO L462 AbstractCegarLoop]: Abstraction has 110844 states and 124116 transitions. [2019-11-23 20:57:25,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 110844 states and 124116 transitions. [2019-11-23 20:57:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-23 20:57:25,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:25,741 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-23 20:57:25,742 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash -56794741, now seen corresponding path program 1 times [2019-11-23 20:57:25,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:25,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735895757] [2019-11-23 20:57:25,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-23 20:57:25,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735895757] [2019-11-23 20:57:25,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159339014] [2019-11-23 20:57:25,902 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:57:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:26,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:26,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-23 20:57:26,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:26,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:57:26,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469260632] [2019-11-23 20:57:26,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:26,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:26,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:26,147 INFO L87 Difference]: Start difference. First operand 110844 states and 124116 transitions. Second operand 3 states. [2019-11-23 20:57:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:27,511 INFO L93 Difference]: Finished difference Result 213169 states and 238872 transitions. [2019-11-23 20:57:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:27,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-11-23 20:57:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:27,604 INFO L225 Difference]: With dead ends: 213169 [2019-11-23 20:57:27,604 INFO L226 Difference]: Without dead ends: 102327 [2019-11-23 20:57:27,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 308 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:57:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102327 states. [2019-11-23 20:57:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102327 to 96834. [2019-11-23 20:57:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96834 states. [2019-11-23 20:57:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96834 states to 96834 states and 106261 transitions. [2019-11-23 20:57:28,878 INFO L78 Accepts]: Start accepts. Automaton has 96834 states and 106261 transitions. Word has length 309 [2019-11-23 20:57:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:28,878 INFO L462 AbstractCegarLoop]: Abstraction has 96834 states and 106261 transitions. [2019-11-23 20:57:28,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 96834 states and 106261 transitions. [2019-11-23 20:57:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-11-23 20:57:28,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:28,923 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 20:57:29,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:29,124 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash -709324062, now seen corresponding path program 1 times [2019-11-23 20:57:29,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:29,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366112584] [2019-11-23 20:57:29,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-23 20:57:29,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366112584] [2019-11-23 20:57:29,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:29,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:29,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469774828] [2019-11-23 20:57:29,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:29,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:29,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:29,446 INFO L87 Difference]: Start difference. First operand 96834 states and 106261 transitions. Second operand 3 states. [2019-11-23 20:57:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:30,763 INFO L93 Difference]: Finished difference Result 188588 states and 207051 transitions. [2019-11-23 20:57:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:30,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2019-11-23 20:57:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:30,868 INFO L225 Difference]: With dead ends: 188588 [2019-11-23 20:57:30,868 INFO L226 Difference]: Without dead ends: 91756 [2019-11-23 20:57:31,443 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:57:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91756 states. [2019-11-23 20:57:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91756 to 88910. [2019-11-23 20:57:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88910 states. [2019-11-23 20:57:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88910 states to 88910 states and 96157 transitions. [2019-11-23 20:57:32,177 INFO L78 Accepts]: Start accepts. Automaton has 88910 states and 96157 transitions. Word has length 491 [2019-11-23 20:57:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:32,178 INFO L462 AbstractCegarLoop]: Abstraction has 88910 states and 96157 transitions. [2019-11-23 20:57:32,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 88910 states and 96157 transitions. [2019-11-23 20:57:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-11-23 20:57:32,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:32,221 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-23 20:57:32,221 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:32,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1820686194, now seen corresponding path program 1 times [2019-11-23 20:57:32,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:32,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325439827] [2019-11-23 20:57:32,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 582 proven. 168 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-23 20:57:35,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325439827] [2019-11-23 20:57:35,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950918504] [2019-11-23 20:57:35,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:35,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:57:35,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-23 20:57:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 721 proven. 29 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-23 20:57:36,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:57:36,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2019-11-23 20:57:36,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757160886] [2019-11-23 20:57:36,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:57:36,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:57:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:57:36,651 INFO L87 Difference]: Start difference. First operand 88910 states and 96157 transitions. Second operand 14 states. [2019-11-23 20:57:44,068 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-11-23 20:57:45,484 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-11-23 20:57:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:49,908 INFO L93 Difference]: Finished difference Result 435456 states and 470965 transitions. [2019-11-23 20:57:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-23 20:57:49,908 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 552 [2019-11-23 20:57:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:50,233 INFO L225 Difference]: With dead ends: 435456 [2019-11-23 20:57:50,233 INFO L226 Difference]: Without dead ends: 346548 [2019-11-23 20:57:50,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 547 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=499, Invalid=1393, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 20:57:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346548 states. [2019-11-23 20:57:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346548 to 277690. [2019-11-23 20:57:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277690 states. [2019-11-23 20:57:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277690 states to 277690 states and 300604 transitions. [2019-11-23 20:57:53,814 INFO L78 Accepts]: Start accepts. Automaton has 277690 states and 300604 transitions. Word has length 552 [2019-11-23 20:57:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:53,814 INFO L462 AbstractCegarLoop]: Abstraction has 277690 states and 300604 transitions. [2019-11-23 20:57:53,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:57:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 277690 states and 300604 transitions. [2019-11-23 20:57:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-11-23 20:57:54,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:54,513 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 20:57:54,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:54,714 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:54,715 INFO L82 PathProgramCache]: Analyzing trace with hash -266166021, now seen corresponding path program 1 times [2019-11-23 20:57:54,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:54,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250294063] [2019-11-23 20:57:54,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 474 proven. 62 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-11-23 20:57:55,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250294063] [2019-11-23 20:57:55,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175637615] [2019-11-23 20:57:55,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:55,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:57:55,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-11-23 20:57:55,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:55,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-23 20:57:55,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315423525] [2019-11-23 20:57:55,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:55,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:57:55,983 INFO L87 Difference]: Start difference. First operand 277690 states and 300604 transitions. Second operand 4 states.