/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/ssh-simplified/s3_srvr_11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:47:58,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:47:58,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:47:58,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:47:58,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:47:58,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:47:58,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:47:58,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:47:58,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:47:58,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:47:58,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:47:58,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:47:58,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:47:58,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:47:58,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:47:58,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:47:58,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:47:58,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:47:58,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:47:58,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:47:58,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:47:58,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:47:58,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:47:58,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:47:58,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:47:58,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:47:58,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:47:58,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:47:58,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:47:58,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:47:58,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:47:58,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:47:58,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:47:58,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:47:58,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:47:58,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:47:58,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:47:58,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:47:58,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:47:58,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:47:58,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:47:58,148 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 22:47:58,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:47:58,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:47:58,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:47:58,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:47:58,173 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:47:58,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:47:58,173 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:47:58,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:47:58,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:47:58,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:47:58,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:47:58,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:47:58,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:47:58,176 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:47:58,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:47:58,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:47:58,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:47:58,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:47:58,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:47:58,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:47:58,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:47:58,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:47:58,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:58,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:47:58,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:47:58,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:47:58,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:47:58,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:47:58,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:47:58,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:47:58,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:47:58,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:47:58,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:47:58,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:47:58,476 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:47:58,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_11.cil.c [2019-11-23 22:47:58,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54471296d/bf49df381a3341d3ab99d6c1eee4ca10/FLAGbe3b1325e [2019-11-23 22:47:59,095 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:47:59,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_11.cil.c [2019-11-23 22:47:59,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54471296d/bf49df381a3341d3ab99d6c1eee4ca10/FLAGbe3b1325e [2019-11-23 22:47:59,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54471296d/bf49df381a3341d3ab99d6c1eee4ca10 [2019-11-23 22:47:59,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:47:59,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:47:59,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:59,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:47:59,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:47:59,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:59" (1/1) ... [2019-11-23 22:47:59,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580da5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:59, skipping insertion in model container [2019-11-23 22:47:59,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:59" (1/1) ... [2019-11-23 22:47:59,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:47:59,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:47:59,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:59,818 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:47:59,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:00,000 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:00,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00 WrapperNode [2019-11-23 22:48:00,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:00,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:00,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:00,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:00,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:00,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:00,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:00,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:00,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (1/1) ... [2019-11-23 22:48:00,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:00,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:00,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:00,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:00,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (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 22:48:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:00,311 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:01,064 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:01,065 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:01,066 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:01,066 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:01,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:01 BoogieIcfgContainer [2019-11-23 22:48:01,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:01,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:01,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:01,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:01,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:59" (1/3) ... [2019-11-23 22:48:01,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3a114b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:01, skipping insertion in model container [2019-11-23 22:48:01,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:00" (2/3) ... [2019-11-23 22:48:01,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3a114b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:01, skipping insertion in model container [2019-11-23 22:48:01,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:01" (3/3) ... [2019-11-23 22:48:01,076 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-11-23 22:48:01,084 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:01,091 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:01,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:01,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:01,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:01,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:01,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:01,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:01,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:01,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:01,133 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 22:48:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:48:01,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:01,162 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] [2019-11-23 22:48:01,163 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-11-23 22:48:01,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:01,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430392047] [2019-11-23 22:48:01,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:01,384 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 22:48:01,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430392047] [2019-11-23 22:48:01,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:01,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:01,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119894853] [2019-11-23 22:48:01,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:01,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:01,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:01,416 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-23 22:48:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:01,765 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-11-23 22:48:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:01,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:48:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:01,790 INFO L225 Difference]: With dead ends: 315 [2019-11-23 22:48:01,790 INFO L226 Difference]: Without dead ends: 154 [2019-11-23 22:48:01,796 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 22:48:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-23 22:48:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-11-23 22:48:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-23 22:48:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-11-23 22:48:01,886 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-11-23 22:48:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:01,887 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-11-23 22:48:01,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-11-23 22:48:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:01,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:01,889 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] [2019-11-23 22:48:01,889 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-11-23 22:48:01,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:01,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535869814] [2019-11-23 22:48:01,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:01,975 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 22:48:01,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535869814] [2019-11-23 22:48:01,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:01,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:01,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609947152] [2019-11-23 22:48:01,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:01,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:01,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:01,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:01,979 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-11-23 22:48:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:02,150 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-11-23 22:48:02,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:02,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:02,153 INFO L225 Difference]: With dead ends: 318 [2019-11-23 22:48:02,153 INFO L226 Difference]: Without dead ends: 173 [2019-11-23 22:48:02,155 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 22:48:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-23 22:48:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-23 22:48:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-23 22:48:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-11-23 22:48:02,168 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-11-23 22:48:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:02,168 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-11-23 22:48:02,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-11-23 22:48:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:02,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:02,170 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] [2019-11-23 22:48:02,170 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-11-23 22:48:02,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:02,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235590114] [2019-11-23 22:48:02,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:02,249 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 22:48:02,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235590114] [2019-11-23 22:48:02,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:02,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:02,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927494959] [2019-11-23 22:48:02,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:02,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:02,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:02,252 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-11-23 22:48:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:02,411 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-11-23 22:48:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:02,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:02,413 INFO L225 Difference]: With dead ends: 347 [2019-11-23 22:48:02,414 INFO L226 Difference]: Without dead ends: 181 [2019-11-23 22:48:02,415 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 22:48:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-23 22:48:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-23 22:48:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-23 22:48:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-11-23 22:48:02,432 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-11-23 22:48:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:02,433 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-11-23 22:48:02,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-11-23 22:48:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:48:02,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:02,435 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] [2019-11-23 22:48:02,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:02,436 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-11-23 22:48:02,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:02,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324927776] [2019-11-23 22:48:02,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:02,521 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 22:48:02,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324927776] [2019-11-23 22:48:02,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:02,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:02,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331773498] [2019-11-23 22:48:02,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:02,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:02,524 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-11-23 22:48:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:02,685 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-11-23 22:48:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:02,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:48:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:02,688 INFO L225 Difference]: With dead ends: 352 [2019-11-23 22:48:02,688 INFO L226 Difference]: Without dead ends: 180 [2019-11-23 22:48:02,689 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 22:48:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-23 22:48:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-23 22:48:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-23 22:48:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-11-23 22:48:02,720 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-11-23 22:48:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:02,720 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-11-23 22:48:02,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-11-23 22:48:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:48:02,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:02,724 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] [2019-11-23 22:48:02,724 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:02,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-11-23 22:48:02,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:02,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951897241] [2019-11-23 22:48:02,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:02,796 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 22:48:02,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951897241] [2019-11-23 22:48:02,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976329604] [2019-11-23 22:48:02,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:02,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:02,800 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-11-23 22:48:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:02,963 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-11-23 22:48:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:02,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:48:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:02,965 INFO L225 Difference]: With dead ends: 363 [2019-11-23 22:48:02,965 INFO L226 Difference]: Without dead ends: 190 [2019-11-23 22:48:02,966 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 22:48:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-23 22:48:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-23 22:48:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-23 22:48:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-11-23 22:48:02,975 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-11-23 22:48:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:02,975 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-11-23 22:48:02,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-11-23 22:48:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:48:02,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:02,977 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] [2019-11-23 22:48:02,977 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:02,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-11-23 22:48:02,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:02,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449215801] [2019-11-23 22:48:02,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:03,013 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 22:48:03,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449215801] [2019-11-23 22:48:03,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:03,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:03,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993528139] [2019-11-23 22:48:03,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:03,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:03,015 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-11-23 22:48:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:03,148 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-11-23 22:48:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:03,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:48:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:03,150 INFO L225 Difference]: With dead ends: 363 [2019-11-23 22:48:03,150 INFO L226 Difference]: Without dead ends: 190 [2019-11-23 22:48:03,151 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 22:48:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-23 22:48:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-23 22:48:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-23 22:48:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-11-23 22:48:03,159 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-11-23 22:48:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:03,159 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-11-23 22:48:03,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-11-23 22:48:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:48:03,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:03,161 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] [2019-11-23 22:48:03,161 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-11-23 22:48:03,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:03,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132653324] [2019-11-23 22:48:03,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:03,185 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 22:48:03,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132653324] [2019-11-23 22:48:03,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:03,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:03,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230317938] [2019-11-23 22:48:03,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:03,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:03,188 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-11-23 22:48:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:03,310 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-11-23 22:48:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:03,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:48:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:03,312 INFO L225 Difference]: With dead ends: 363 [2019-11-23 22:48:03,312 INFO L226 Difference]: Without dead ends: 190 [2019-11-23 22:48:03,313 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 22:48:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-23 22:48:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-23 22:48:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-23 22:48:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-11-23 22:48:03,321 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-11-23 22:48:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:03,321 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-11-23 22:48:03,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-11-23 22:48:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:48:03,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:03,322 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] [2019-11-23 22:48:03,323 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-11-23 22:48:03,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:03,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943660591] [2019-11-23 22:48:03,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:03,360 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 22:48:03,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943660591] [2019-11-23 22:48:03,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:03,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:03,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632622933] [2019-11-23 22:48:03,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:03,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:03,362 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-11-23 22:48:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:03,627 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-11-23 22:48:03,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:48:03,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-23 22:48:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:03,630 INFO L225 Difference]: With dead ends: 511 [2019-11-23 22:48:03,630 INFO L226 Difference]: Without dead ends: 338 [2019-11-23 22:48:03,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-23 22:48:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-11-23 22:48:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 22:48:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-11-23 22:48:03,649 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-11-23 22:48:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:03,649 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-11-23 22:48:03,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-11-23 22:48:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 22:48:03,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:03,651 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] [2019-11-23 22:48:03,654 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:03,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:03,654 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-11-23 22:48:03,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:03,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943560578] [2019-11-23 22:48:03,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:03,720 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 22:48:03,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943560578] [2019-11-23 22:48:03,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:03,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:03,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887927271] [2019-11-23 22:48:03,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:03,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:03,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:03,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:03,724 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-11-23 22:48:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:03,894 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-11-23 22:48:03,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:03,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-23 22:48:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:03,897 INFO L225 Difference]: With dead ends: 698 [2019-11-23 22:48:03,897 INFO L226 Difference]: Without dead ends: 382 [2019-11-23 22:48:03,898 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 22:48:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-23 22:48:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-11-23 22:48:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-23 22:48:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-11-23 22:48:03,916 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-11-23 22:48:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:03,918 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-11-23 22:48:03,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-11-23 22:48:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:48:03,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:03,919 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] [2019-11-23 22:48:03,920 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-11-23 22:48:03,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:03,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185225936] [2019-11-23 22:48:03,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:03,964 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 22:48:03,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185225936] [2019-11-23 22:48:03,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:03,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:03,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235465548] [2019-11-23 22:48:03,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:03,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:03,967 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-11-23 22:48:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:04,138 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-11-23 22:48:04,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:04,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 22:48:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:04,141 INFO L225 Difference]: With dead ends: 775 [2019-11-23 22:48:04,141 INFO L226 Difference]: Without dead ends: 406 [2019-11-23 22:48:04,142 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 22:48:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-23 22:48:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-11-23 22:48:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-23 22:48:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-11-23 22:48:04,160 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-11-23 22:48:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:04,160 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-11-23 22:48:04,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-11-23 22:48:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:48:04,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:04,162 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] [2019-11-23 22:48:04,162 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-11-23 22:48:04,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:04,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438443093] [2019-11-23 22:48:04,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:48:04,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438443093] [2019-11-23 22:48:04,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:04,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:04,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406352716] [2019-11-23 22:48:04,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:04,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:04,195 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-11-23 22:48:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:04,403 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-11-23 22:48:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:04,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:48:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:04,407 INFO L225 Difference]: With dead ends: 829 [2019-11-23 22:48:04,407 INFO L226 Difference]: Without dead ends: 438 [2019-11-23 22:48:04,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-23 22:48:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-11-23 22:48:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-23 22:48:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-11-23 22:48:04,433 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-11-23 22:48:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:04,433 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-11-23 22:48:04,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-11-23 22:48:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 22:48:04,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:04,435 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:04,436 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:04,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-11-23 22:48:04,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:04,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192265983] [2019-11-23 22:48:04,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 22:48:04,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192265983] [2019-11-23 22:48:04,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:04,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:04,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026713436] [2019-11-23 22:48:04,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:04,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:04,487 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-11-23 22:48:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:04,625 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-11-23 22:48:04,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:04,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-23 22:48:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:04,630 INFO L225 Difference]: With dead ends: 911 [2019-11-23 22:48:04,630 INFO L226 Difference]: Without dead ends: 480 [2019-11-23 22:48:04,631 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 22:48:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-23 22:48:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-23 22:48:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-23 22:48:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-11-23 22:48:04,651 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-11-23 22:48:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:04,652 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-11-23 22:48:04,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-11-23 22:48:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:48:04,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:04,653 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:04,654 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-11-23 22:48:04,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:04,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407680137] [2019-11-23 22:48:04,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 22:48:04,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407680137] [2019-11-23 22:48:04,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:04,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:04,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281164866] [2019-11-23 22:48:04,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:04,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:04,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:04,709 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-11-23 22:48:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:04,859 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-11-23 22:48:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:04,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-23 22:48:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:04,863 INFO L225 Difference]: With dead ends: 949 [2019-11-23 22:48:04,863 INFO L226 Difference]: Without dead ends: 480 [2019-11-23 22:48:04,864 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 22:48:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-23 22:48:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-23 22:48:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-23 22:48:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-11-23 22:48:04,885 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-11-23 22:48:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:04,886 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-11-23 22:48:04,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-11-23 22:48:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:04,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:04,887 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:04,888 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-11-23 22:48:04,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:04,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341983284] [2019-11-23 22:48:04,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 22:48:04,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341983284] [2019-11-23 22:48:04,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:04,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:04,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263984532] [2019-11-23 22:48:04,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:04,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:04,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:04,927 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-11-23 22:48:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,087 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-11-23 22:48:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,090 INFO L225 Difference]: With dead ends: 997 [2019-11-23 22:48:05,091 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:48:05,092 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 22:48:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:48:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-23 22:48:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-23 22:48:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-11-23 22:48:05,118 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-11-23 22:48:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,118 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-11-23 22:48:05,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-11-23 22:48:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:05,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,120 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:05,121 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-11-23 22:48:05,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001718516] [2019-11-23 22:48:05,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 22:48:05,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001718516] [2019-11-23 22:48:05,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:05,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:05,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658631707] [2019-11-23 22:48:05,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:05,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:05,161 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-11-23 22:48:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,316 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-11-23 22:48:05,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,320 INFO L225 Difference]: With dead ends: 1033 [2019-11-23 22:48:05,320 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:48:05,323 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 22:48:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:48:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-23 22:48:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-23 22:48:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-11-23 22:48:05,344 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-11-23 22:48:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,344 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-11-23 22:48:05,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-11-23 22:48:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:05,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:05,345 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-11-23 22:48:05,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528542616] [2019-11-23 22:48:05,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:05,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528542616] [2019-11-23 22:48:05,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:05,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:05,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751339045] [2019-11-23 22:48:05,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:05,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:05,401 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-11-23 22:48:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,585 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-11-23 22:48:05,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,589 INFO L225 Difference]: With dead ends: 1078 [2019-11-23 22:48:05,589 INFO L226 Difference]: Without dead ends: 573 [2019-11-23 22:48:05,590 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 22:48:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-23 22:48:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-11-23 22:48:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-23 22:48:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-11-23 22:48:05,611 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-11-23 22:48:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,611 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-11-23 22:48:05,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-11-23 22:48:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-23 22:48:05,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:05,613 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-11-23 22:48:05,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964823424] [2019-11-23 22:48:05,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:05,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964823424] [2019-11-23 22:48:05,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:05,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:05,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271710069] [2019-11-23 22:48:05,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:05,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:05,668 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-11-23 22:48:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:05,838 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-11-23 22:48:05,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:05,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-23 22:48:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:05,842 INFO L225 Difference]: With dead ends: 1131 [2019-11-23 22:48:05,842 INFO L226 Difference]: Without dead ends: 571 [2019-11-23 22:48:05,843 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 22:48:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-23 22:48:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-11-23 22:48:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-23 22:48:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-11-23 22:48:05,864 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-11-23 22:48:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:05,864 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-11-23 22:48:05,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-11-23 22:48:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:48:05,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:05,866 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 22:48:05,866 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:05,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-11-23 22:48:05,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:05,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44100425] [2019-11-23 22:48:05,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:48:05,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44100425] [2019-11-23 22:48:05,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:05,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:05,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168196791] [2019-11-23 22:48:05,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:05,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:05,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:05,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:05,897 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-11-23 22:48:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,031 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-11-23 22:48:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 22:48:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,035 INFO L225 Difference]: With dead ends: 1159 [2019-11-23 22:48:06,035 INFO L226 Difference]: Without dead ends: 603 [2019-11-23 22:48:06,037 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 22:48:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-23 22:48:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-23 22:48:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-23 22:48:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-11-23 22:48:06,062 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-11-23 22:48:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,062 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-11-23 22:48:06,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-11-23 22:48:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 22:48:06,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,066 INFO L410 BasicCegarLoop]: trace histogram [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, 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 22:48:06,066 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-11-23 22:48:06,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577325639] [2019-11-23 22:48:06,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:48:06,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577325639] [2019-11-23 22:48:06,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306686019] [2019-11-23 22:48:06,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,100 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-11-23 22:48:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,240 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-11-23 22:48:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-23 22:48:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,244 INFO L225 Difference]: With dead ends: 1189 [2019-11-23 22:48:06,244 INFO L226 Difference]: Without dead ends: 603 [2019-11-23 22:48:06,246 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 22:48:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-23 22:48:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-23 22:48:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-23 22:48:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-11-23 22:48:06,277 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-11-23 22:48:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,277 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-11-23 22:48:06,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-11-23 22:48:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 22:48:06,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,279 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:06,279 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,280 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-11-23 22:48:06,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072768472] [2019-11-23 22:48:06,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-23 22:48:06,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072768472] [2019-11-23 22:48:06,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847083589] [2019-11-23 22:48:06,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,344 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-11-23 22:48:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,474 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-11-23 22:48:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-23 22:48:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,478 INFO L225 Difference]: With dead ends: 1239 [2019-11-23 22:48:06,479 INFO L226 Difference]: Without dead ends: 653 [2019-11-23 22:48:06,480 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 22:48:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-23 22:48:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-23 22:48:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-23 22:48:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-11-23 22:48:06,502 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-11-23 22:48:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,503 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-11-23 22:48:06,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-11-23 22:48:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:48:06,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,505 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:06,505 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-11-23 22:48:06,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725466370] [2019-11-23 22:48:06,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-23 22:48:06,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725466370] [2019-11-23 22:48:06,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638363149] [2019-11-23 22:48:06,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,537 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-11-23 22:48:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,679 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-11-23 22:48:06,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-23 22:48:06,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,683 INFO L225 Difference]: With dead ends: 1273 [2019-11-23 22:48:06,683 INFO L226 Difference]: Without dead ends: 653 [2019-11-23 22:48:06,684 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 22:48:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-23 22:48:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-23 22:48:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-23 22:48:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-11-23 22:48:06,708 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-11-23 22:48:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,708 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-11-23 22:48:06,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-11-23 22:48:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 22:48:06,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,710 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:06,710 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-11-23 22:48:06,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906458054] [2019-11-23 22:48:06,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:48:06,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906458054] [2019-11-23 22:48:06,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:06,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:06,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139588749] [2019-11-23 22:48:06,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:06,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:06,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:06,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:06,745 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-11-23 22:48:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:06,932 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-11-23 22:48:06,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:06,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-23 22:48:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:06,937 INFO L225 Difference]: With dead ends: 1300 [2019-11-23 22:48:06,937 INFO L226 Difference]: Without dead ends: 680 [2019-11-23 22:48:06,939 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 22:48:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-23 22:48:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-11-23 22:48:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-23 22:48:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-11-23 22:48:06,991 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-11-23 22:48:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:06,991 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-11-23 22:48:06,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-11-23 22:48:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-23 22:48:06,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:06,993 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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 22:48:06,994 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-11-23 22:48:06,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:06,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088389714] [2019-11-23 22:48:06,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-23 22:48:07,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088389714] [2019-11-23 22:48:07,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:07,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911683340] [2019-11-23 22:48:07,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,049 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-11-23 22:48:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,112 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-11-23 22:48:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-23 22:48:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,119 INFO L225 Difference]: With dead ends: 1343 [2019-11-23 22:48:07,119 INFO L226 Difference]: Without dead ends: 1341 [2019-11-23 22:48:07,120 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 22:48:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-23 22:48:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-11-23 22:48:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-11-23 22:48:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-11-23 22:48:07,171 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-11-23 22:48:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,171 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-11-23 22:48:07,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-11-23 22:48:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-23 22:48:07,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,174 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 22:48:07,175 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,175 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-11-23 22:48:07,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038057854] [2019-11-23 22:48:07,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 22:48:07,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038057854] [2019-11-23 22:48:07,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:07,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67148701] [2019-11-23 22:48:07,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,212 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-11-23 22:48:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,277 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-11-23 22:48:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-23 22:48:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,286 INFO L225 Difference]: With dead ends: 3328 [2019-11-23 22:48:07,287 INFO L226 Difference]: Without dead ends: 1996 [2019-11-23 22:48:07,289 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 22:48:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-11-23 22:48:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-11-23 22:48:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-23 22:48:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-11-23 22:48:07,350 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-11-23 22:48:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,351 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-11-23 22:48:07,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-11-23 22:48:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-23 22:48:07,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,354 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 22:48:07,354 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-11-23 22:48:07,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482768979] [2019-11-23 22:48:07,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 22:48:07,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482768979] [2019-11-23 22:48:07,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098382002] [2019-11-23 22:48:07,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,385 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-11-23 22:48:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,499 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-11-23 22:48:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-23 22:48:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,538 INFO L225 Difference]: With dead ends: 4616 [2019-11-23 22:48:07,538 INFO L226 Difference]: Without dead ends: 2629 [2019-11-23 22:48:07,541 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 22:48:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-11-23 22:48:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-11-23 22:48:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-11-23 22:48:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-11-23 22:48:07,629 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-11-23 22:48:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:07,629 INFO L462 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-11-23 22:48:07,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-11-23 22:48:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 22:48:07,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:07,634 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 22:48:07,634 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-11-23 22:48:07,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:07,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25767543] [2019-11-23 22:48:07,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 22:48:07,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25767543] [2019-11-23 22:48:07,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:07,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:07,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107850803] [2019-11-23 22:48:07,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:07,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:07,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:07,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:07,667 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-11-23 22:48:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:07,887 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-11-23 22:48:07,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:07,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-23 22:48:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:07,900 INFO L225 Difference]: With dead ends: 5375 [2019-11-23 22:48:07,900 INFO L226 Difference]: Without dead ends: 2755 [2019-11-23 22:48:07,905 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 22:48:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-23 22:48:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-23 22:48:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-23 22:48:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-11-23 22:48:08,018 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-11-23 22:48:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,018 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-11-23 22:48:08,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-11-23 22:48:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 22:48:08,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,023 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 22:48:08,023 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,023 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-11-23 22:48:08,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982550632] [2019-11-23 22:48:08,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 22:48:08,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982550632] [2019-11-23 22:48:08,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:08,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2275472] [2019-11-23 22:48:08,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,075 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-11-23 22:48:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,290 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-11-23 22:48:08,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 22:48:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,305 INFO L225 Difference]: With dead ends: 5471 [2019-11-23 22:48:08,305 INFO L226 Difference]: Without dead ends: 2755 [2019-11-23 22:48:08,310 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 22:48:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-23 22:48:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-23 22:48:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-23 22:48:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-11-23 22:48:08,404 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-11-23 22:48:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,404 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-11-23 22:48:08,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-11-23 22:48:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:48:08,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,408 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 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] [2019-11-23 22:48:08,408 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-11-23 22:48:08,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515299108] [2019-11-23 22:48:08,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 22:48:08,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515299108] [2019-11-23 22:48:08,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:08,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863664407] [2019-11-23 22:48:08,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,454 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-11-23 22:48:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:08,678 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-11-23 22:48:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:08,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:48:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:08,691 INFO L225 Difference]: With dead ends: 5521 [2019-11-23 22:48:08,691 INFO L226 Difference]: Without dead ends: 2805 [2019-11-23 22:48:08,695 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 22:48:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-11-23 22:48:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-11-23 22:48:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-23 22:48:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-11-23 22:48:08,799 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-11-23 22:48:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:08,799 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-11-23 22:48:08,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-11-23 22:48:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:48:08,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:08,804 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 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] [2019-11-23 22:48:08,804 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-11-23 22:48:08,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:08,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072956383] [2019-11-23 22:48:08,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 22:48:08,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072956383] [2019-11-23 22:48:08,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:08,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:08,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56049279] [2019-11-23 22:48:08,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:08,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:08,899 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-11-23 22:48:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,218 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-11-23 22:48:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:48:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,259 INFO L225 Difference]: With dead ends: 5711 [2019-11-23 22:48:09,259 INFO L226 Difference]: Without dead ends: 2995 [2019-11-23 22:48:09,269 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 22:48:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-11-23 22:48:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-11-23 22:48:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-11-23 22:48:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-11-23 22:48:09,395 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-11-23 22:48:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:09,395 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-11-23 22:48:09,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-11-23 22:48:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 22:48:09,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:09,400 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2019-11-23 22:48:09,401 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-11-23 22:48:09,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:09,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727505465] [2019-11-23 22:48:09,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:09,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727505465] [2019-11-23 22:48:09,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590811064] [2019-11-23 22:48:09,492 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 22:48:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:09,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:09,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-23 22:48:09,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:09,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:09,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371989606] [2019-11-23 22:48:09,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:09,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:09,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:09,701 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 3 states. [2019-11-23 22:48:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:09,879 INFO L93 Difference]: Finished difference Result 8484 states and 12071 transitions. [2019-11-23 22:48:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:09,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 22:48:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:09,892 INFO L225 Difference]: With dead ends: 8484 [2019-11-23 22:48:09,893 INFO L226 Difference]: Without dead ends: 5652 [2019-11-23 22:48:09,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-11-23 22:48:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-11-23 22:48:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-11-23 22:48:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8033 transitions. [2019-11-23 22:48:10,210 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8033 transitions. Word has length 171 [2019-11-23 22:48:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:10,211 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8033 transitions. [2019-11-23 22:48:10,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8033 transitions. [2019-11-23 22:48:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 22:48:10,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:10,223 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2019-11-23 22:48:10,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:10,430 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1741886925, now seen corresponding path program 1 times [2019-11-23 22:48:10,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:10,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785761636] [2019-11-23 22:48:10,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:10,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785761636] [2019-11-23 22:48:10,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978449659] [2019-11-23 22:48:10,564 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 22:48:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:10,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:10,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-23 22:48:10,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:10,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:10,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13338737] [2019-11-23 22:48:10,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:10,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:10,768 INFO L87 Difference]: Start difference. First operand 5650 states and 8033 transitions. Second operand 3 states. [2019-11-23 22:48:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:11,189 INFO L93 Difference]: Finished difference Result 11836 states and 16798 transitions. [2019-11-23 22:48:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:11,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 22:48:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:11,204 INFO L225 Difference]: With dead ends: 11836 [2019-11-23 22:48:11,204 INFO L226 Difference]: Without dead ends: 5994 [2019-11-23 22:48:11,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-11-23 22:48:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5834. [2019-11-23 22:48:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-11-23 22:48:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8265 transitions. [2019-11-23 22:48:11,414 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8265 transitions. Word has length 172 [2019-11-23 22:48:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:11,415 INFO L462 AbstractCegarLoop]: Abstraction has 5834 states and 8265 transitions. [2019-11-23 22:48:11,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8265 transitions. [2019-11-23 22:48:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 22:48:11,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:11,424 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2019-11-23 22:48:11,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:11,630 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:11,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1648497422, now seen corresponding path program 1 times [2019-11-23 22:48:11,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:11,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889935208] [2019-11-23 22:48:11,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:11,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889935208] [2019-11-23 22:48:11,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634001137] [2019-11-23 22:48:11,691 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 22:48:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:11,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:11,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-11-23 22:48:11,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:11,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:11,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284600732] [2019-11-23 22:48:11,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:11,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:11,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:11,839 INFO L87 Difference]: Start difference. First operand 5834 states and 8265 transitions. Second operand 3 states. [2019-11-23 22:48:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:12,236 INFO L93 Difference]: Finished difference Result 10593 states and 14957 transitions. [2019-11-23 22:48:12,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:12,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 22:48:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:12,300 INFO L225 Difference]: With dead ends: 10593 [2019-11-23 22:48:12,300 INFO L226 Difference]: Without dead ends: 4615 [2019-11-23 22:48:12,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2019-11-23 22:48:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4471. [2019-11-23 22:48:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-23 22:48:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6324 transitions. [2019-11-23 22:48:12,462 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6324 transitions. Word has length 173 [2019-11-23 22:48:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:12,462 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6324 transitions. [2019-11-23 22:48:12,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6324 transitions. [2019-11-23 22:48:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-23 22:48:12,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:12,469 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:12,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:12,673 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash 492657149, now seen corresponding path program 1 times [2019-11-23 22:48:12,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:12,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135134423] [2019-11-23 22:48:12,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 22:48:12,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135134423] [2019-11-23 22:48:12,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891593425] [2019-11-23 22:48:12,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 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 22:48:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:12,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:12,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-23 22:48:12,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:12,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-23 22:48:12,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013382299] [2019-11-23 22:48:12,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:12,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:12,891 INFO L87 Difference]: Start difference. First operand 4471 states and 6324 transitions. Second operand 3 states. [2019-11-23 22:48:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:13,030 INFO L93 Difference]: Finished difference Result 8870 states and 12551 transitions. [2019-11-23 22:48:13,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:13,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-23 22:48:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:13,041 INFO L225 Difference]: With dead ends: 8870 [2019-11-23 22:48:13,041 INFO L226 Difference]: Without dead ends: 4473 [2019-11-23 22:48:13,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-11-23 22:48:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4471. [2019-11-23 22:48:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-23 22:48:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6308 transitions. [2019-11-23 22:48:13,183 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6308 transitions. Word has length 176 [2019-11-23 22:48:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:13,184 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6308 transitions. [2019-11-23 22:48:13,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6308 transitions. [2019-11-23 22:48:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-23 22:48:13,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:13,191 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:13,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:13,395 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash 750822587, now seen corresponding path program 1 times [2019-11-23 22:48:13,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:13,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947866697] [2019-11-23 22:48:13,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 22:48:13,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947866697] [2019-11-23 22:48:13,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594036947] [2019-11-23 22:48:13,491 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 22:48:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:13,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:13,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-11-23 22:48:13,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:13,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-23 22:48:13,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755569731] [2019-11-23 22:48:13,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:13,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:13,672 INFO L87 Difference]: Start difference. First operand 4471 states and 6308 transitions. Second operand 3 states. [2019-11-23 22:48:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:13,971 INFO L93 Difference]: Finished difference Result 7803 states and 10977 transitions. [2019-11-23 22:48:13,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:13,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-23 22:48:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:13,979 INFO L225 Difference]: With dead ends: 7803 [2019-11-23 22:48:13,979 INFO L226 Difference]: Without dead ends: 3298 [2019-11-23 22:48:13,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-11-23 22:48:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3178. [2019-11-23 22:48:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-23 22:48:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4467 transitions. [2019-11-23 22:48:14,092 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4467 transitions. Word has length 176 [2019-11-23 22:48:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:14,093 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4467 transitions. [2019-11-23 22:48:14,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4467 transitions. [2019-11-23 22:48:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 22:48:14,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:14,099 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:14,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:14,312 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 290208357, now seen corresponding path program 2 times [2019-11-23 22:48:14,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:14,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862777431] [2019-11-23 22:48:14,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 191 proven. 19 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:14,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862777431] [2019-11-23 22:48:14,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591856087] [2019-11-23 22:48:14,389 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 22:48:14,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-23 22:48:14,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:48:14,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:14,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-23 22:48:14,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:14,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:14,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735703054] [2019-11-23 22:48:14,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:14,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:14,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:14,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:14,491 INFO L87 Difference]: Start difference. First operand 3178 states and 4467 transitions. Second operand 3 states. [2019-11-23 22:48:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:14,783 INFO L93 Difference]: Finished difference Result 6414 states and 9030 transitions. [2019-11-23 22:48:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:14,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-23 22:48:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:14,792 INFO L225 Difference]: With dead ends: 6414 [2019-11-23 22:48:14,792 INFO L226 Difference]: Without dead ends: 3362 [2019-11-23 22:48:14,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-11-23 22:48:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3178. [2019-11-23 22:48:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-23 22:48:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4451 transitions. [2019-11-23 22:48:14,978 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4451 transitions. Word has length 181 [2019-11-23 22:48:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:14,978 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4451 transitions. [2019-11-23 22:48:14,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4451 transitions. [2019-11-23 22:48:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-23 22:48:14,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:14,984 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:15,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:15,188 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1359170395, now seen corresponding path program 1 times [2019-11-23 22:48:15,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:15,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549229764] [2019-11-23 22:48:15,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:15,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549229764] [2019-11-23 22:48:15,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023183941] [2019-11-23 22:48:15,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:15,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:15,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-23 22:48:15,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:15,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:15,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47050224] [2019-11-23 22:48:15,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:15,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:15,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:15,374 INFO L87 Difference]: Start difference. First operand 3178 states and 4451 transitions. Second operand 3 states. [2019-11-23 22:48:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:15,540 INFO L93 Difference]: Finished difference Result 9098 states and 12761 transitions. [2019-11-23 22:48:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:15,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-23 22:48:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:15,552 INFO L225 Difference]: With dead ends: 9098 [2019-11-23 22:48:15,552 INFO L226 Difference]: Without dead ends: 6110 [2019-11-23 22:48:15,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-11-23 22:48:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6108. [2019-11-23 22:48:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-11-23 22:48:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8553 transitions. [2019-11-23 22:48:15,750 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8553 transitions. Word has length 183 [2019-11-23 22:48:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:15,750 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 8553 transitions. [2019-11-23 22:48:15,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8553 transitions. [2019-11-23 22:48:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 22:48:15,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:15,758 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-23 22:48:15,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:15,962 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash -580968611, now seen corresponding path program 1 times [2019-11-23 22:48:15,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:15,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821232944] [2019-11-23 22:48:15,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:16,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821232944] [2019-11-23 22:48:16,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64273617] [2019-11-23 22:48:16,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:16,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:16,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-23 22:48:16,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:16,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:16,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573833043] [2019-11-23 22:48:16,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:16,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:16,143 INFO L87 Difference]: Start difference. First operand 6108 states and 8553 transitions. Second operand 3 states. [2019-11-23 22:48:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:16,403 INFO L93 Difference]: Finished difference Result 12076 states and 16919 transitions. [2019-11-23 22:48:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:16,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-23 22:48:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:16,425 INFO L225 Difference]: With dead ends: 12076 [2019-11-23 22:48:16,425 INFO L226 Difference]: Without dead ends: 9088 [2019-11-23 22:48:16,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-11-23 22:48:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9086. [2019-11-23 22:48:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-11-23 22:48:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12719 transitions. [2019-11-23 22:48:16,724 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12719 transitions. Word has length 185 [2019-11-23 22:48:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:16,725 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 12719 transitions. [2019-11-23 22:48:16,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12719 transitions. [2019-11-23 22:48:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-23 22:48:16,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:16,733 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2019-11-23 22:48:16,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:16,938 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash -607881575, now seen corresponding path program 1 times [2019-11-23 22:48:16,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:16,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856470337] [2019-11-23 22:48:16,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:16,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856470337] [2019-11-23 22:48:16,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836121655] [2019-11-23 22:48:16,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:48:17,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-23 22:48:17,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:17,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403635139] [2019-11-23 22:48:17,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:17,104 INFO L87 Difference]: Start difference. First operand 9086 states and 12719 transitions. Second operand 3 states. [2019-11-23 22:48:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,536 INFO L93 Difference]: Finished difference Result 20674 states and 28969 transitions. [2019-11-23 22:48:17,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-23 22:48:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,558 INFO L225 Difference]: With dead ends: 20674 [2019-11-23 22:48:17,558 INFO L226 Difference]: Without dead ends: 14708 [2019-11-23 22:48:17,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-11-23 22:48:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14706. [2019-11-23 22:48:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-23 22:48:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20587 transitions. [2019-11-23 22:48:18,125 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20587 transitions. Word has length 186 [2019-11-23 22:48:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,126 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20587 transitions. [2019-11-23 22:48:18,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20587 transitions. [2019-11-23 22:48:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-23 22:48:18,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,135 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-23 22:48:18,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:18,339 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash 9813042, now seen corresponding path program 3 times [2019-11-23 22:48:18,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258307026] [2019-11-23 22:48:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 198 proven. 21 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:18,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258307026] [2019-11-23 22:48:18,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909366274] [2019-11-23 22:48:18,405 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:18,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-23 22:48:18,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:48:18,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:18,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-11-23 22:48:18,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:18,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:18,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503498799] [2019-11-23 22:48:18,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:18,511 INFO L87 Difference]: Start difference. First operand 14706 states and 20587 transitions. Second operand 3 states. [2019-11-23 22:48:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,008 INFO L93 Difference]: Finished difference Result 30070 states and 42014 transitions. [2019-11-23 22:48:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-23 22:48:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,029 INFO L225 Difference]: With dead ends: 30070 [2019-11-23 22:48:19,029 INFO L226 Difference]: Without dead ends: 15314 [2019-11-23 22:48:19,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2019-11-23 22:48:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 14706. [2019-11-23 22:48:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-23 22:48:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20547 transitions. [2019-11-23 22:48:19,440 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20547 transitions. Word has length 186 [2019-11-23 22:48:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,441 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20547 transitions. [2019-11-23 22:48:19,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20547 transitions. [2019-11-23 22:48:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 22:48:19,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,447 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-23 22:48:19,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:19,649 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash 854141729, now seen corresponding path program 1 times [2019-11-23 22:48:19,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833881635] [2019-11-23 22:48:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 198 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:19,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833881635] [2019-11-23 22:48:19,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327629029] [2019-11-23 22:48:19,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 22:48:19,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-23 22:48:19,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:19,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:48:19,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274180545] [2019-11-23 22:48:19,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:19,949 INFO L87 Difference]: Start difference. First operand 14706 states and 20547 transitions. Second operand 3 states. [2019-11-23 22:48:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,332 INFO L93 Difference]: Finished difference Result 29822 states and 41582 transitions. [2019-11-23 22:48:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 22:48:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,348 INFO L225 Difference]: With dead ends: 29822 [2019-11-23 22:48:20,348 INFO L226 Difference]: Without dead ends: 15186 [2019-11-23 22:48:20,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-11-23 22:48:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 14706. [2019-11-23 22:48:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-23 22:48:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20523 transitions. [2019-11-23 22:48:20,761 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20523 transitions. Word has length 187 [2019-11-23 22:48:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,761 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20523 transitions. [2019-11-23 22:48:20,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20523 transitions. [2019-11-23 22:48:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-23 22:48:20,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,768 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2019-11-23 22:48:20,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:20,969 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1508265096, now seen corresponding path program 4 times [2019-11-23 22:48:20,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877308232] [2019-11-23 22:48:20,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-23 22:48:21,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877308232] [2019-11-23 22:48:21,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943519020] [2019-11-23 22:48:21,167 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:21,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:48:21,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:48:21,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:48:21,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-23 22:48:21,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:21,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-23 22:48:21,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174096724] [2019-11-23 22:48:21,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:48:21,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:21,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:48:21,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:21,318 INFO L87 Difference]: Start difference. First operand 14706 states and 20523 transitions. Second operand 7 states. [2019-11-23 22:48:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:23,058 INFO L93 Difference]: Finished difference Result 50232 states and 68987 transitions. [2019-11-23 22:48:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:48:23,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-11-23 22:48:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:23,086 INFO L225 Difference]: With dead ends: 50232 [2019-11-23 22:48:23,086 INFO L226 Difference]: Without dead ends: 34696 [2019-11-23 22:48:23,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:48:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2019-11-23 22:48:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 17906. [2019-11-23 22:48:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17906 states. [2019-11-23 22:48:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 24463 transitions. [2019-11-23 22:48:23,632 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 24463 transitions. Word has length 188 [2019-11-23 22:48:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:23,632 INFO L462 AbstractCegarLoop]: Abstraction has 17906 states and 24463 transitions. [2019-11-23 22:48:23,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:48:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 24463 transitions. [2019-11-23 22:48:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 22:48:23,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:23,637 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-23 22:48:23,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:23,837 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-11-23 22:48:23,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:23,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885001852] [2019-11-23 22:48:23,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:24,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:48:24,059 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:48:24,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:48:24 BoogieIcfgContainer [2019-11-23 22:48:24,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:48:24,195 INFO L168 Benchmark]: Toolchain (without parser) took 24741.67 ms. Allocated memory was 146.3 MB in the beginning and 1.0 GB in the end (delta: 863.5 MB). Free memory was 102.0 MB in the beginning and 296.9 MB in the end (delta: -194.9 MB). Peak memory consumption was 668.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:24,195 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 22:48:24,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.91 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 178.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:24,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.84 ms. Allocated memory is still 203.9 MB. Free memory was 178.8 MB in the beginning and 175.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:24,197 INFO L168 Benchmark]: Boogie Preprocessor took 41.67 ms. Allocated memory is still 203.9 MB. Free memory was 175.5 MB in the beginning and 173.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:24,197 INFO L168 Benchmark]: RCFGBuilder took 958.02 ms. Allocated memory is still 203.9 MB. Free memory was 172.9 MB in the beginning and 118.3 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:24,197 INFO L168 Benchmark]: TraceAbstraction took 23123.22 ms. Allocated memory was 203.9 MB in the beginning and 1.0 GB in the end (delta: 805.8 MB). Free memory was 118.3 MB in the beginning and 296.9 MB in the end (delta: -178.7 MB). Peak memory consumption was 627.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:24,200 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 547.91 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 178.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.84 ms. Allocated memory is still 203.9 MB. Free memory was 178.8 MB in the beginning and 175.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.67 ms. Allocated memory is still 203.9 MB. Free memory was 175.5 MB in the beginning and 173.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 958.02 ms. Allocated memory is still 203.9 MB. Free memory was 172.9 MB in the beginning and 118.3 MB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23123.22 ms. Allocated memory was 203.9 MB in the beginning and 1.0 GB in the end (delta: 805.8 MB). Free memory was 118.3 MB in the beginning and 296.9 MB in the end (delta: -178.7 MB). Peak memory consumption was 627.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L635] int s ; [L636] int tmp ; [L640] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND FALSE !(\read(s__hit)) [L299] s__state = 8512 [L301] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L306] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L307] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L308] COND TRUE __cil_tmp56 + 256UL [L309] skip = 1 [L317] s__state = 8528 [L318] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L322] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L323] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L325] __cil_tmp57 = (unsigned long )s__options [L326] COND TRUE __cil_tmp57 + 2097152UL [L327] s__s3__tmp__use_rsa_tmp = 1 [L332] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L359] ret = __VERIFIER_nondet_int() [L360] COND FALSE !(ret <= 0) [L377] s__state = 8544 [L378] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND TRUE s__state == 8544 [L382] COND TRUE s__verify_mode + 1 [L383] COND FALSE !(s__session__peer != 0) [L394] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L395] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L396] COND FALSE !(__cil_tmp61 + 256UL) [L406] s__s3__tmp__cert_request = 1 [L407] ret = __VERIFIER_nondet_int() [L408] COND FALSE !(ret <= 0) [L411] s__state = 8448 [L412] s__s3__tmp__next_state___0 = 8576 [L413] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND TRUE s__state == 8448 [L434] COND FALSE !(num1 > 0L) [L443] s__state = s__s3__tmp__next_state___0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND TRUE s__state == 8576 [L447] ret = __VERIFIER_nondet_int() [L448] COND FALSE !(ret <= 0) [L451] COND FALSE !(ret == 2) [L454] ret = __VERIFIER_nondet_int() [L455] COND FALSE !(ret <= 0) [L458] s__init_num = 0 [L459] s__state = 8592 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND TRUE state == 8576 [L603] COND TRUE s__state == 8592 [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE tmp___2 != -16384 [L606] COND TRUE __cil_tmp56 != 4294967040 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE tmp___7 != 1024 [L609] COND TRUE tmp___7 != 512 [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 23.0s, OverallIterations: 42, TraceHistogramMax: 7, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8062 SDtfs, 6835 SDslu, 4489 SDs, 0 SdLazy, 4523 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2283 GetRequests, 2203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17906occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 41 MinimizatonAttempts, 19003 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 6893 NumberOfCodeBlocks, 6601 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6649 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685570 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3883 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 53 InterpolantComputations, 40 PerfectInterpolantSequences, 9886/10231 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...