/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_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:57:03,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:57:03,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:57:03,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:57:03,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:57:03,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:57:03,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:57:03,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:57:03,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:57:03,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:57:03,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:57:03,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:57:03,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:57:03,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:57:03,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:57:03,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:57:03,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:57:03,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:57:03,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:57:03,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:57:03,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:57:03,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:57:03,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:57:03,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:57:03,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:57:03,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:57:03,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:57:03,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:57:03,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:57:03,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:57:03,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:57:03,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:57:03,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:57:03,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:57:03,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:57:03,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:57:03,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:57:03,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:57:03,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:57:03,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:57:03,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:57:03,447 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:57:03,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:57:03,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:57:03,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:57:03,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:57:03,467 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:57:03,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:57:03,467 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:57:03,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:57:03,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:57:03,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:57:03,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:57:03,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:57:03,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:57:03,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:57:03,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:57:03,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:57:03,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:57:03,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:57:03,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:57:03,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:57:03,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:57:03,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:57:03,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:57:03,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:57:03,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:57:03,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:57:03,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:57:03,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:57:03,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:57:03,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:57:03,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:57:03,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:57:03,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:57:03,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:57:03,776 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:57:03,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label56.c [2019-11-23 20:57:03,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d20d1828/b5e196e7a86541949679ea4bb663a140/FLAGc6b5f1e16 [2019-11-23 20:57:04,443 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:57:04,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label56.c [2019-11-23 20:57:04,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d20d1828/b5e196e7a86541949679ea4bb663a140/FLAGc6b5f1e16 [2019-11-23 20:57:04,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d20d1828/b5e196e7a86541949679ea4bb663a140 [2019-11-23 20:57:04,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:57:04,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:57:04,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:57:04,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:57:04,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:57:04,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:04" (1/1) ... [2019-11-23 20:57:04,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447643de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:04, skipping insertion in model container [2019-11-23 20:57:04,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:04" (1/1) ... [2019-11-23 20:57:04,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:57:04,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:57:05,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:57:05,537 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:57:05,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:57:05,884 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:57:05,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05 WrapperNode [2019-11-23 20:57:05,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:57:05,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:57:05,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:57:05,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:57:05,896 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:57:05" (1/1) ... [2019-11-23 20:57:05,950 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:57:05" (1/1) ... [2019-11-23 20:57:06,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:57:06,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:57:06,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:57:06,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:57:06,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:06,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:06,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:06,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:06,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:06,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:06,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (1/1) ... [2019-11-23 20:57:06,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:57:06,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:57:06,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:57:06,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:57:06,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (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:57:06,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:57:06,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:57:08,287 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:57:08,287 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:57:08,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:08 BoogieIcfgContainer [2019-11-23 20:57:08,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:57:08,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:57:08,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:57:08,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:57:08,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:57:04" (1/3) ... [2019-11-23 20:57:08,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267bfa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:08, skipping insertion in model container [2019-11-23 20:57:08,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:05" (2/3) ... [2019-11-23 20:57:08,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267bfa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:08, skipping insertion in model container [2019-11-23 20:57:08,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:08" (3/3) ... [2019-11-23 20:57:08,301 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label56.c [2019-11-23 20:57:08,311 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:57:08,321 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:57:08,333 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:57:08,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:57:08,378 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:57:08,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:57:08,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:57:08,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:57:08,379 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:57:08,379 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:57:08,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:57:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:57:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 20:57:08,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:08,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:08,466 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:08,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1827749397, now seen corresponding path program 1 times [2019-11-23 20:57:08,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:08,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704745678] [2019-11-23 20:57:08,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:09,192 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:57:09,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704745678] [2019-11-23 20:57:09,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:09,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:09,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256943673] [2019-11-23 20:57:09,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:09,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:09,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:09,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:09,220 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:57:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:11,444 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-23 20:57:11,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:11,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-23 20:57:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:11,470 INFO L225 Difference]: With dead ends: 1075 [2019-11-23 20:57:11,470 INFO L226 Difference]: Without dead ends: 677 [2019-11-23 20:57:11,476 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:57:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-23 20:57:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-23 20:57:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-23 20:57:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-23 20:57:11,568 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 173 [2019-11-23 20:57:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:11,570 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-23 20:57:11,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-23 20:57:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 20:57:11,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:11,579 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:57:11,579 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash -719650132, now seen corresponding path program 1 times [2019-11-23 20:57:11,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:11,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001419287] [2019-11-23 20:57:11,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:11,698 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:57:11,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001419287] [2019-11-23 20:57:11,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:11,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:11,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117629842] [2019-11-23 20:57:11,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:11,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:11,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:11,703 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-23 20:57:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:12,919 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-23 20:57:12,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:12,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-23 20:57:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:12,925 INFO L225 Difference]: With dead ends: 1323 [2019-11-23 20:57:12,926 INFO L226 Difference]: Without dead ends: 874 [2019-11-23 20:57:12,928 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,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-23 20:57:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-23 20:57:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-23 20:57:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-23 20:57:12,966 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 181 [2019-11-23 20:57:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:12,966 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-23 20:57:12,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-23 20:57:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 20:57:12,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:12,971 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash -321719515, now seen corresponding path program 1 times [2019-11-23 20:57:12,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:12,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421237584] [2019-11-23 20:57:12,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:13,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421237584] [2019-11-23 20:57:13,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:13,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:13,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140913017] [2019-11-23 20:57:13,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:13,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:13,076 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-11-23 20:57:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:14,759 INFO L93 Difference]: Finished difference Result 3366 states and 5171 transitions. [2019-11-23 20:57:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:14,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-23 20:57:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:14,773 INFO L225 Difference]: With dead ends: 3366 [2019-11-23 20:57:14,773 INFO L226 Difference]: Without dead ends: 2509 [2019-11-23 20:57:14,775 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:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-11-23 20:57:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1682. [2019-11-23 20:57:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-11-23 20:57:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2436 transitions. [2019-11-23 20:57:14,821 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2436 transitions. Word has length 182 [2019-11-23 20:57:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:14,822 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2436 transitions. [2019-11-23 20:57:14,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2436 transitions. [2019-11-23 20:57:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-23 20:57:14,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:14,827 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,828 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 447712849, now seen corresponding path program 1 times [2019-11-23 20:57:14,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:14,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208184645] [2019-11-23 20:57:14,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:14,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208184645] [2019-11-23 20:57:14,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:14,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:14,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657635152] [2019-11-23 20:57:14,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:14,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:14,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:14,952 INFO L87 Difference]: Start difference. First operand 1682 states and 2436 transitions. Second operand 3 states. [2019-11-23 20:57:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:15,958 INFO L93 Difference]: Finished difference Result 4187 states and 6045 transitions. [2019-11-23 20:57:15,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:15,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-23 20:57:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:15,972 INFO L225 Difference]: With dead ends: 4187 [2019-11-23 20:57:15,972 INFO L226 Difference]: Without dead ends: 2507 [2019-11-23 20:57:15,975 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:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-11-23 20:57:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2506. [2019-11-23 20:57:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-23 20:57:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3555 transitions. [2019-11-23 20:57:16,025 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3555 transitions. Word has length 183 [2019-11-23 20:57:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:16,026 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 3555 transitions. [2019-11-23 20:57:16,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3555 transitions. [2019-11-23 20:57:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 20:57:16,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:16,032 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash 620298465, now seen corresponding path program 1 times [2019-11-23 20:57:16,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:16,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566147173] [2019-11-23 20:57:16,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:16,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566147173] [2019-11-23 20:57:16,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:16,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:16,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073467450] [2019-11-23 20:57:16,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:16,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:16,268 INFO L87 Difference]: Start difference. First operand 2506 states and 3555 transitions. Second operand 3 states. [2019-11-23 20:57:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:17,381 INFO L93 Difference]: Finished difference Result 7453 states and 10581 transitions. [2019-11-23 20:57:17,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:17,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-23 20:57:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:17,405 INFO L225 Difference]: With dead ends: 7453 [2019-11-23 20:57:17,406 INFO L226 Difference]: Without dead ends: 4949 [2019-11-23 20:57:17,410 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:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2019-11-23 20:57:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4948. [2019-11-23 20:57:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-11-23 20:57:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 6564 transitions. [2019-11-23 20:57:17,509 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 6564 transitions. Word has length 188 [2019-11-23 20:57:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:17,510 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 6564 transitions. [2019-11-23 20:57:17,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 6564 transitions. [2019-11-23 20:57:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-23 20:57:17,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:17,520 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,521 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash -351874234, now seen corresponding path program 1 times [2019-11-23 20:57:17,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:17,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704572113] [2019-11-23 20:57:17,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:17,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704572113] [2019-11-23 20:57:17,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2166683] [2019-11-23 20:57:17,704 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:57:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:17,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:57:17,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:17,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:17,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:57:17,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889138551] [2019-11-23 20:57:17,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:17,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:57:17,957 INFO L87 Difference]: Start difference. First operand 4948 states and 6564 transitions. Second operand 3 states. [2019-11-23 20:57:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:18,949 INFO L93 Difference]: Finished difference Result 13957 states and 18513 transitions. [2019-11-23 20:57:18,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:18,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-11-23 20:57:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:19,001 INFO L225 Difference]: With dead ends: 13957 [2019-11-23 20:57:19,001 INFO L226 Difference]: Without dead ends: 9011 [2019-11-23 20:57:19,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:57:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9011 states. [2019-11-23 20:57:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9011 to 9008. [2019-11-23 20:57:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-11-23 20:57:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 10901 transitions. [2019-11-23 20:57:19,307 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 10901 transitions. Word has length 190 [2019-11-23 20:57:19,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:19,308 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 10901 transitions. [2019-11-23 20:57:19,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 10901 transitions. [2019-11-23 20:57:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-23 20:57:19,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:19,334 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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:19,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:19,540 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:19,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1777361011, now seen corresponding path program 1 times [2019-11-23 20:57:19,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:19,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465665030] [2019-11-23 20:57:19,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:57:19,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465665030] [2019-11-23 20:57:19,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:19,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:19,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247677559] [2019-11-23 20:57:19,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:19,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:19,722 INFO L87 Difference]: Start difference. First operand 9008 states and 10901 transitions. Second operand 4 states. [2019-11-23 20:57:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:20,927 INFO L93 Difference]: Finished difference Result 18015 states and 21802 transitions. [2019-11-23 20:57:20,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:20,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-23 20:57:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:20,963 INFO L225 Difference]: With dead ends: 18015 [2019-11-23 20:57:20,963 INFO L226 Difference]: Without dead ends: 9009 [2019-11-23 20:57:21,070 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:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9009 states. [2019-11-23 20:57:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9009 to 9008. [2019-11-23 20:57:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2019-11-23 20:57:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 10546 transitions. [2019-11-23 20:57:21,216 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 10546 transitions. Word has length 208 [2019-11-23 20:57:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:21,217 INFO L462 AbstractCegarLoop]: Abstraction has 9008 states and 10546 transitions. [2019-11-23 20:57:21,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 10546 transitions. [2019-11-23 20:57:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-23 20:57:21,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:21,235 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,235 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2081080370, now seen corresponding path program 1 times [2019-11-23 20:57:21,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:21,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819970329] [2019-11-23 20:57:21,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:21,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819970329] [2019-11-23 20:57:21,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:21,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:57:21,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068746556] [2019-11-23 20:57:21,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:57:21,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:57:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:21,412 INFO L87 Difference]: Start difference. First operand 9008 states and 10546 transitions. Second operand 5 states. [2019-11-23 20:57:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:23,441 INFO L93 Difference]: Finished difference Result 42500 states and 49799 transitions. [2019-11-23 20:57:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:57:23,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-11-23 20:57:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:23,500 INFO L225 Difference]: With dead ends: 42500 [2019-11-23 20:57:23,500 INFO L226 Difference]: Without dead ends: 33494 [2019-11-23 20:57:23,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:57:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33494 states. [2019-11-23 20:57:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33494 to 33488. [2019-11-23 20:57:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33488 states. [2019-11-23 20:57:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33488 states to 33488 states and 39089 transitions. [2019-11-23 20:57:23,998 INFO L78 Accepts]: Start accepts. Automaton has 33488 states and 39089 transitions. Word has length 233 [2019-11-23 20:57:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:23,998 INFO L462 AbstractCegarLoop]: Abstraction has 33488 states and 39089 transitions. [2019-11-23 20:57:23,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:57:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 33488 states and 39089 transitions. [2019-11-23 20:57:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-23 20:57:24,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:24,020 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,020 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1454619846, now seen corresponding path program 1 times [2019-11-23 20:57:24,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:24,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224869154] [2019-11-23 20:57:24,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:25,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224869154] [2019-11-23 20:57:25,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:25,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:25,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532217588] [2019-11-23 20:57:25,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:25,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:25,045 INFO L87 Difference]: Start difference. First operand 33488 states and 39089 transitions. Second operand 4 states. [2019-11-23 20:57:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:26,744 INFO L93 Difference]: Finished difference Result 83720 states and 97203 transitions. [2019-11-23 20:57:26,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:26,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-23 20:57:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:26,836 INFO L225 Difference]: With dead ends: 83720 [2019-11-23 20:57:26,836 INFO L226 Difference]: Without dead ends: 50234 [2019-11-23 20:57:26,875 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:57:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50234 states. [2019-11-23 20:57:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50234 to 38796. [2019-11-23 20:57:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38796 states. [2019-11-23 20:57:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38796 states to 38796 states and 44750 transitions. [2019-11-23 20:57:27,558 INFO L78 Accepts]: Start accepts. Automaton has 38796 states and 44750 transitions. Word has length 236 [2019-11-23 20:57:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:27,559 INFO L462 AbstractCegarLoop]: Abstraction has 38796 states and 44750 transitions. [2019-11-23 20:57:27,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38796 states and 44750 transitions. [2019-11-23 20:57:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-23 20:57:27,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:27,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,578 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash 726117733, now seen corresponding path program 1 times [2019-11-23 20:57:27,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:27,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645314250] [2019-11-23 20:57:27,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:27,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645314250] [2019-11-23 20:57:27,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513357049] [2019-11-23 20:57:27,756 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:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:27,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:27,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:57:27,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:27,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:57:27,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126216223] [2019-11-23 20:57:27,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:27,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:27,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:27,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:27,973 INFO L87 Difference]: Start difference. First operand 38796 states and 44750 transitions. Second operand 3 states. [2019-11-23 20:57:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:29,221 INFO L93 Difference]: Finished difference Result 76989 states and 88862 transitions. [2019-11-23 20:57:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:29,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-11-23 20:57:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:29,276 INFO L225 Difference]: With dead ends: 76989 [2019-11-23 20:57:29,276 INFO L226 Difference]: Without dead ends: 38195 [2019-11-23 20:57:29,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 242 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:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38195 states. [2019-11-23 20:57:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38195 to 37172. [2019-11-23 20:57:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37172 states. [2019-11-23 20:57:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37172 states to 37172 states and 41757 transitions. [2019-11-23 20:57:29,749 INFO L78 Accepts]: Start accepts. Automaton has 37172 states and 41757 transitions. Word has length 243 [2019-11-23 20:57:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:29,750 INFO L462 AbstractCegarLoop]: Abstraction has 37172 states and 41757 transitions. [2019-11-23 20:57:29,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 37172 states and 41757 transitions. [2019-11-23 20:57:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-23 20:57:29,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:29,774 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:57:29,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:29,978 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1059581109, now seen corresponding path program 1 times [2019-11-23 20:57:29,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:29,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668548542] [2019-11-23 20:57:29,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:57:30,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668548542] [2019-11-23 20:57:30,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:30,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:57:30,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787091856] [2019-11-23 20:57:30,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:30,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:30,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:30,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:57:30,380 INFO L87 Difference]: Start difference. First operand 37172 states and 41757 transitions. Second operand 3 states. [2019-11-23 20:57:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:31,627 INFO L93 Difference]: Finished difference Result 85710 states and 96668 transitions. [2019-11-23 20:57:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:31,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-11-23 20:57:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:31,675 INFO L225 Difference]: With dead ends: 85710 [2019-11-23 20:57:31,675 INFO L226 Difference]: Without dead ends: 48540 [2019-11-23 20:57:31,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48540 states. [2019-11-23 20:57:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48540 to 47523. [2019-11-23 20:57:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47523 states. [2019-11-23 20:57:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47523 states to 47523 states and 52396 transitions. [2019-11-23 20:57:32,233 INFO L78 Accepts]: Start accepts. Automaton has 47523 states and 52396 transitions. Word has length 284 [2019-11-23 20:57:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:32,234 INFO L462 AbstractCegarLoop]: Abstraction has 47523 states and 52396 transitions. [2019-11-23 20:57:32,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 47523 states and 52396 transitions. [2019-11-23 20:57:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-23 20:57:32,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:32,480 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:57:32,481 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:32,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash 955808973, now seen corresponding path program 1 times [2019-11-23 20:57:32,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:32,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927878072] [2019-11-23 20:57:32,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 20:57:32,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927878072] [2019-11-23 20:57:32,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890898767] [2019-11-23 20:57:32,726 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:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:32,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:32,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 20:57:33,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:33,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-23 20:57:33,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419785087] [2019-11-23 20:57:33,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:33,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:33,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:33,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:33,187 INFO L87 Difference]: Start difference. First operand 47523 states and 52396 transitions. Second operand 3 states. [2019-11-23 20:57:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:33,706 INFO L93 Difference]: Finished difference Result 140922 states and 155373 transitions. [2019-11-23 20:57:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:33,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-11-23 20:57:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:33,825 INFO L225 Difference]: With dead ends: 140922 [2019-11-23 20:57:33,826 INFO L226 Difference]: Without dead ends: 93401 [2019-11-23 20:57:33,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 333 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:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93401 states. [2019-11-23 20:57:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93401 to 93397. [2019-11-23 20:57:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93397 states. [2019-11-23 20:57:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93397 states to 93397 states and 102972 transitions. [2019-11-23 20:57:36,630 INFO L78 Accepts]: Start accepts. Automaton has 93397 states and 102972 transitions. Word has length 334 [2019-11-23 20:57:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:36,630 INFO L462 AbstractCegarLoop]: Abstraction has 93397 states and 102972 transitions. [2019-11-23 20:57:36,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 93397 states and 102972 transitions. [2019-11-23 20:57:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-23 20:57:36,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:36,665 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:36,870 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:36,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:36,871 INFO L82 PathProgramCache]: Analyzing trace with hash 164272381, now seen corresponding path program 1 times [2019-11-23 20:57:36,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:36,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181690792] [2019-11-23 20:57:36,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-23 20:57:37,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181690792] [2019-11-23 20:57:37,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:37,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:37,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867166700] [2019-11-23 20:57:37,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:37,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:37,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:37,480 INFO L87 Difference]: Start difference. First operand 93397 states and 102972 transitions. Second operand 4 states. [2019-11-23 20:57:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:39,412 INFO L93 Difference]: Finished difference Result 242994 states and 267337 transitions. [2019-11-23 20:57:39,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:39,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-23 20:57:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:39,538 INFO L225 Difference]: With dead ends: 242994 [2019-11-23 20:57:39,538 INFO L226 Difference]: Without dead ends: 149599 [2019-11-23 20:57:39,592 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:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149599 states. [2019-11-23 20:57:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149599 to 104765. [2019-11-23 20:57:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104765 states. [2019-11-23 20:57:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104765 states to 104765 states and 115730 transitions. [2019-11-23 20:57:42,825 INFO L78 Accepts]: Start accepts. Automaton has 104765 states and 115730 transitions. Word has length 399 [2019-11-23 20:57:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:42,825 INFO L462 AbstractCegarLoop]: Abstraction has 104765 states and 115730 transitions. [2019-11-23 20:57:42,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 104765 states and 115730 transitions. [2019-11-23 20:57:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-11-23 20:57:42,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:42,861 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,861 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash -59129241, now seen corresponding path program 1 times [2019-11-23 20:57:42,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:42,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538224083] [2019-11-23 20:57:42,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 121 proven. 3 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2019-11-23 20:57:43,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538224083] [2019-11-23 20:57:43,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005595712] [2019-11-23 20:57:43,072 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:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:43,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:57:43,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:57:43,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:43,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:57:43,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36775936] [2019-11-23 20:57:43,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:43,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:43,772 INFO L87 Difference]: Start difference. First operand 104765 states and 115730 transitions. Second operand 3 states. [2019-11-23 20:57:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:44,643 INFO L93 Difference]: Finished difference Result 297330 states and 327995 transitions. [2019-11-23 20:57:44,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:57:44,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-11-23 20:57:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:44,828 INFO L225 Difference]: With dead ends: 297330 [2019-11-23 20:57:44,829 INFO L226 Difference]: Without dead ends: 192567 [2019-11-23 20:57:44,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 417 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:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192567 states. [2019-11-23 20:57:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192567 to 188093. [2019-11-23 20:57:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188093 states. [2019-11-23 20:57:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188093 states to 188093 states and 205616 transitions. [2019-11-23 20:57:48,879 INFO L78 Accepts]: Start accepts. Automaton has 188093 states and 205616 transitions. Word has length 418 [2019-11-23 20:57:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:48,880 INFO L462 AbstractCegarLoop]: Abstraction has 188093 states and 205616 transitions. [2019-11-23 20:57:48,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:57:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 188093 states and 205616 transitions. [2019-11-23 20:57:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-23 20:57:48,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:48,922 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:57:49,125 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash -990841587, now seen corresponding path program 1 times [2019-11-23 20:57:49,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:49,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105798870] [2019-11-23 20:57:49,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-23 20:57:49,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105798870] [2019-11-23 20:57:49,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:57:49,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:57:49,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817437601] [2019-11-23 20:57:49,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:57:49,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:49,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:57:49,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:57:49,835 INFO L87 Difference]: Start difference. First operand 188093 states and 205616 transitions. Second operand 4 states. [2019-11-23 20:57:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:57:52,210 INFO L93 Difference]: Finished difference Result 395448 states and 432603 transitions. [2019-11-23 20:57:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:57:52,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-11-23 20:57:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:57:52,411 INFO L225 Difference]: With dead ends: 395448 [2019-11-23 20:57:52,411 INFO L226 Difference]: Without dead ends: 207357 [2019-11-23 20:57:52,502 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:57:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207357 states. [2019-11-23 20:57:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207357 to 194645. [2019-11-23 20:57:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194645 states. [2019-11-23 20:57:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194645 states to 194645 states and 212116 transitions. [2019-11-23 20:57:57,605 INFO L78 Accepts]: Start accepts. Automaton has 194645 states and 212116 transitions. Word has length 420 [2019-11-23 20:57:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:57:57,605 INFO L462 AbstractCegarLoop]: Abstraction has 194645 states and 212116 transitions. [2019-11-23 20:57:57,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:57:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 194645 states and 212116 transitions. [2019-11-23 20:57:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-11-23 20:57:57,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:57:57,653 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,654 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:57:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:57:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1589860891, now seen corresponding path program 1 times [2019-11-23 20:57:57,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:57:57,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304580423] [2019-11-23 20:57:57,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:57:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 146 proven. 3 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-23 20:57:58,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304580423] [2019-11-23 20:57:58,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313104767] [2019-11-23 20:57:58,431 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:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:57:58,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:57:58,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:57:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-23 20:57:58,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:57:58,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:57:58,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417094335] [2019-11-23 20:57:58,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:57:58,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:57:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:57:58,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:57:58,832 INFO L87 Difference]: Start difference. First operand 194645 states and 212116 transitions. Second operand 3 states. [2019-11-23 20:58:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:58:00,743 INFO L93 Difference]: Finished difference Result 387261 states and 421981 transitions. [2019-11-23 20:58:00,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:58:00,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2019-11-23 20:58:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:58:00,936 INFO L225 Difference]: With dead ends: 387261 [2019-11-23 20:58:00,936 INFO L226 Difference]: Without dead ends: 192618 [2019-11-23 20:58:01,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 431 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:58:01,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192618 states. [2019-11-23 20:58:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192618 to 188538. [2019-11-23 20:58:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188538 states. [2019-11-23 20:58:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188538 states to 188538 states and 204274 transitions. [2019-11-23 20:58:03,434 INFO L78 Accepts]: Start accepts. Automaton has 188538 states and 204274 transitions. Word has length 432 [2019-11-23 20:58:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:58:03,435 INFO L462 AbstractCegarLoop]: Abstraction has 188538 states and 204274 transitions. [2019-11-23 20:58:03,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:58:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 188538 states and 204274 transitions. [2019-11-23 20:58:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-11-23 20:58:03,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:58:03,489 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:58:03,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:58:03,690 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:58:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:58:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1324647101, now seen corresponding path program 1 times [2019-11-23 20:58:03,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:58:03,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007581862] [2019-11-23 20:58:03,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:58:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:58:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 198 proven. 3 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-23 20:58:07,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007581862] [2019-11-23 20:58:07,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654410691] [2019-11-23 20:58:07,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:58:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:58:07,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:58:07,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:58:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2019-11-23 20:58:07,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:58:07,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:58:07,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30980576] [2019-11-23 20:58:07,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:58:07,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:58:07,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:58:07,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:58:07,627 INFO L87 Difference]: Start difference. First operand 188538 states and 204274 transitions. Second operand 3 states. [2019-11-23 20:58:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:58:08,999 INFO L93 Difference]: Finished difference Result 520266 states and 563767 transitions. [2019-11-23 20:58:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:58:08,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 530 [2019-11-23 20:58:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:58:09,319 INFO L225 Difference]: With dead ends: 520266 [2019-11-23 20:58:09,320 INFO L226 Difference]: Without dead ends: 331730 [2019-11-23 20:58:09,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 529 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:58:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331730 states.