/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/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 23:05:10,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 23:05:10,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 23:05:10,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 23:05:10,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 23:05:10,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 23:05:10,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 23:05:10,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 23:05:10,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 23:05:10,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 23:05:10,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 23:05:10,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 23:05:10,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 23:05:10,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 23:05:10,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 23:05:10,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 23:05:10,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 23:05:10,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 23:05:10,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 23:05:10,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 23:05:10,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 23:05:10,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 23:05:10,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 23:05:10,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 23:05:10,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 23:05:10,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 23:05:10,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 23:05:10,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 23:05:10,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 23:05:10,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 23:05:10,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 23:05:10,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 23:05:10,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 23:05:10,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 23:05:10,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 23:05:10,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 23:05:10,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 23:05:10,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 23:05:10,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 23:05:10,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 23:05:10,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 23:05:10,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 23:05:10,333 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 23:05:10,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 23:05:10,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 23:05:10,336 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 23:05:10,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 23:05:10,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 23:05:10,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 23:05:10,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 23:05:10,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 23:05:10,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 23:05:10,338 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 23:05:10,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 23:05:10,338 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 23:05:10,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 23:05:10,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 23:05:10,339 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 23:05:10,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 23:05:10,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 23:05:10,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 23:05:10,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 23:05:10,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 23:05:10,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 23:05:10,341 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 23:05:10,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 23:05:10,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 23:05:10,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 23:05:10,662 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 23:05:10,663 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 23:05:10,664 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-08-22 23:05:10,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e747c21f/42da7101668c48efab3417c36f714df8/FLAGf932b9d92 [2020-08-22 23:05:11,269 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 23:05:11,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-08-22 23:05:11,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e747c21f/42da7101668c48efab3417c36f714df8/FLAGf932b9d92 [2020-08-22 23:05:11,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e747c21f/42da7101668c48efab3417c36f714df8 [2020-08-22 23:05:11,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 23:05:11,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 23:05:11,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 23:05:11,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 23:05:11,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 23:05:11,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:11,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d24573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11, skipping insertion in model container [2020-08-22 23:05:11,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:11,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 23:05:11,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 23:05:11,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:05:11,866 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 23:05:11,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:05:11,905 INFO L208 MainTranslator]: Completed translation [2020-08-22 23:05:11,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11 WrapperNode [2020-08-22 23:05:11,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 23:05:11,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 23:05:11,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 23:05:11,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 23:05:11,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:11,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:12,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:12,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:12,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:12,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:12,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (1/1) ... [2020-08-22 23:05:12,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 23:05:12,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 23:05:12,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 23:05:12,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 23:05:12,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (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 [2020-08-22 23:05:12,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 23:05:12,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 23:05:12,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 23:05:12,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-08-22 23:05:12,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 23:05:12,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 23:05:12,112 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 23:05:12,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 23:05:12,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-08-22 23:05:12,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 23:05:12,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 23:05:12,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 23:05:12,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 23:05:12,376 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 23:05:12,377 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 23:05:12,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:05:12 BoogieIcfgContainer [2020-08-22 23:05:12,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 23:05:12,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 23:05:12,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 23:05:12,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 23:05:12,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 11:05:11" (1/3) ... [2020-08-22 23:05:12,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5609c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:05:12, skipping insertion in model container [2020-08-22 23:05:12,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:05:11" (2/3) ... [2020-08-22 23:05:12,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5609c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:05:12, skipping insertion in model container [2020-08-22 23:05:12,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:05:12" (3/3) ... [2020-08-22 23:05:12,395 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-08-22 23:05:12,411 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 23:05:12,421 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 23:05:12,464 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 23:05:12,518 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 23:05:12,519 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 23:05:12,519 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 23:05:12,519 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 23:05:12,519 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 23:05:12,519 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 23:05:12,520 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 23:05:12,520 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 23:05:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-08-22 23:05:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-08-22 23:05:12,548 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:12,549 INFO L422 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] [2020-08-22 23:05:12,549 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-08-22 23:05:12,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:12,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082974022] [2020-08-22 23:05:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:12,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:05:12,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082974022] [2020-08-22 23:05:12,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:12,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-08-22 23:05:12,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344147067] [2020-08-22 23:05:12,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-08-22 23:05:12,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-08-22 23:05:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-08-22 23:05:12,720 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-08-22 23:05:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:12,753 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-08-22 23:05:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-08-22 23:05:12,754 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-08-22 23:05:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:12,764 INFO L225 Difference]: With dead ends: 91 [2020-08-22 23:05:12,764 INFO L226 Difference]: Without dead ends: 47 [2020-08-22 23:05:12,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-08-22 23:05:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-08-22 23:05:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-08-22 23:05:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-08-22 23:05:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-08-22 23:05:12,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-08-22 23:05:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:12,815 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-08-22 23:05:12,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-08-22 23:05:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-08-22 23:05:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 23:05:12,816 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:12,817 INFO L422 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] [2020-08-22 23:05:12,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 23:05:12,817 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-08-22 23:05:12,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:12,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386113424] [2020-08-22 23:05:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:12,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:05:12,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386113424] [2020-08-22 23:05:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 23:05:12,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619378511] [2020-08-22 23:05:12,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 23:05:12,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:12,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 23:05:12,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 23:05:12,954 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-08-22 23:05:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:13,074 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-08-22 23:05:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 23:05:13,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-08-22 23:05:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:13,078 INFO L225 Difference]: With dead ends: 66 [2020-08-22 23:05:13,078 INFO L226 Difference]: Without dead ends: 64 [2020-08-22 23:05:13,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 23:05:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-22 23:05:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-08-22 23:05:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-22 23:05:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-08-22 23:05:13,102 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-08-22 23:05:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:13,103 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-08-22 23:05:13,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 23:05:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-08-22 23:05:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-22 23:05:13,105 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:13,105 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-22 23:05:13,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 23:05:13,106 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:13,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:13,106 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-08-22 23:05:13,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:13,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325159573] [2020-08-22 23:05:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 23:05:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:05:13,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1325159573] [2020-08-22 23:05:13,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:13,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 23:05:13,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90345748] [2020-08-22 23:05:13,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 23:05:13,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:13,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 23:05:13,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-08-22 23:05:13,251 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-08-22 23:05:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:13,427 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-08-22 23:05:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 23:05:13,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-08-22 23:05:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:13,436 INFO L225 Difference]: With dead ends: 70 [2020-08-22 23:05:13,436 INFO L226 Difference]: Without dead ends: 68 [2020-08-22 23:05:13,438 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-22 23:05:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-08-22 23:05:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-08-22 23:05:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-22 23:05:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-08-22 23:05:13,479 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-08-22 23:05:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:13,479 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-08-22 23:05:13,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 23:05:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-08-22 23:05:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-08-22 23:05:13,487 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:13,487 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-22 23:05:13,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 23:05:13,488 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-08-22 23:05:13,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:13,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223986201] [2020-08-22 23:05:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 23:05:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:05:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 23:05:13,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223986201] [2020-08-22 23:05:13,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:13,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:05:13,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250717456] [2020-08-22 23:05:13,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:05:13,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:13,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:05:13,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:05:13,612 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-08-22 23:05:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:13,774 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-08-22 23:05:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:05:13,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-08-22 23:05:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:13,777 INFO L225 Difference]: With dead ends: 77 [2020-08-22 23:05:13,777 INFO L226 Difference]: Without dead ends: 75 [2020-08-22 23:05:13,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:05:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-22 23:05:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-08-22 23:05:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-22 23:05:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-08-22 23:05:13,793 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-08-22 23:05:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:13,794 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-08-22 23:05:13,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:05:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-08-22 23:05:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-08-22 23:05:13,796 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:13,796 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:05:13,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 23:05:13,796 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-08-22 23:05:13,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:13,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586649902] [2020-08-22 23:05:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 23:05:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:05:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-08-22 23:05:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 23:05:13,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586649902] [2020-08-22 23:05:13,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:13,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 23:05:13,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391029284] [2020-08-22 23:05:13,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 23:05:13,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 23:05:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 23:05:13,964 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-08-22 23:05:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:14,185 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-08-22 23:05:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 23:05:14,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-08-22 23:05:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:14,187 INFO L225 Difference]: With dead ends: 81 [2020-08-22 23:05:14,187 INFO L226 Difference]: Without dead ends: 63 [2020-08-22 23:05:14,188 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:05:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-22 23:05:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-08-22 23:05:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 23:05:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-08-22 23:05:14,200 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-08-22 23:05:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:14,201 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-08-22 23:05:14,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 23:05:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-08-22 23:05:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-22 23:05:14,209 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:14,209 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-22 23:05:14,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 23:05:14,209 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:14,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-08-22 23:05:14,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:14,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777481382] [2020-08-22 23:05:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 23:05:14,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777481382] [2020-08-22 23:05:14,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:14,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:05:14,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170020369] [2020-08-22 23:05:14,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:05:14,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:05:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:05:14,349 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-08-22 23:05:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:14,461 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-08-22 23:05:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:05:14,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-08-22 23:05:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:14,467 INFO L225 Difference]: With dead ends: 72 [2020-08-22 23:05:14,467 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 23:05:14,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:05:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 23:05:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-08-22 23:05:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-08-22 23:05:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-08-22 23:05:14,496 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-08-22 23:05:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:14,497 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-08-22 23:05:14,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:05:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-08-22 23:05:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-08-22 23:05:14,498 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:14,499 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:05:14,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 23:05:14,501 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-08-22 23:05:14,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:14,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79641871] [2020-08-22 23:05:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 23:05:14,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [79641871] [2020-08-22 23:05:14,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:14,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:05:14,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89607063] [2020-08-22 23:05:14,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:05:14,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:05:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:05:14,639 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-08-22 23:05:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:14,902 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-08-22 23:05:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 23:05:14,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-08-22 23:05:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:14,905 INFO L225 Difference]: With dead ends: 98 [2020-08-22 23:05:14,905 INFO L226 Difference]: Without dead ends: 96 [2020-08-22 23:05:14,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-08-22 23:05:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-08-22 23:05:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-08-22 23:05:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-08-22 23:05:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-08-22 23:05:14,922 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-08-22 23:05:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:14,923 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-08-22 23:05:14,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:05:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-08-22 23:05:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 23:05:14,924 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:14,925 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2020-08-22 23:05:14,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 23:05:14,925 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-08-22 23:05:14,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:14,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [103120638] [2020-08-22 23:05:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:14,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-08-22 23:05:15,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [103120638] [2020-08-22 23:05:15,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:15,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:05:15,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179223332] [2020-08-22 23:05:15,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:05:15,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:05:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:05:15,020 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-08-22 23:05:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:15,129 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-08-22 23:05:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 23:05:15,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-08-22 23:05:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:15,133 INFO L225 Difference]: With dead ends: 83 [2020-08-22 23:05:15,133 INFO L226 Difference]: Without dead ends: 81 [2020-08-22 23:05:15,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:05:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-08-22 23:05:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-08-22 23:05:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-08-22 23:05:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-08-22 23:05:15,148 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-08-22 23:05:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:15,149 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-08-22 23:05:15,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:05:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-08-22 23:05:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 23:05:15,150 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:15,150 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2020-08-22 23:05:15,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 23:05:15,151 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-08-22 23:05:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:15,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720130957] [2020-08-22 23:05:15,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 23:05:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-22 23:05:15,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720130957] [2020-08-22 23:05:15,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:05:15,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 23:05:15,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809009199] [2020-08-22 23:05:15,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 23:05:15,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 23:05:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 23:05:15,298 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-08-22 23:05:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:15,534 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-08-22 23:05:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 23:05:15,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-08-22 23:05:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:15,536 INFO L225 Difference]: With dead ends: 100 [2020-08-22 23:05:15,536 INFO L226 Difference]: Without dead ends: 98 [2020-08-22 23:05:15,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:05:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-08-22 23:05:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-08-22 23:05:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-22 23:05:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-08-22 23:05:15,552 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-08-22 23:05:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:15,553 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-08-22 23:05:15,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 23:05:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-08-22 23:05:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 23:05:15,554 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:15,554 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2020-08-22 23:05:15,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 23:05:15,555 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-08-22 23:05:15,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:15,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1107691191] [2020-08-22 23:05:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 23:05:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 23:05:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-08-22 23:05:15,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1107691191] [2020-08-22 23:05:15,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:05:15,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:05:15,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632261568] [2020-08-22 23:05:15,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:05:15,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:15,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:05:15,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:05:15,669 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-08-22 23:05:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:15,820 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-08-22 23:05:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 23:05:15,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-08-22 23:05:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:15,822 INFO L225 Difference]: With dead ends: 100 [2020-08-22 23:05:15,823 INFO L226 Difference]: Without dead ends: 98 [2020-08-22 23:05:15,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-08-22 23:05:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-08-22 23:05:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-08-22 23:05:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-08-22 23:05:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-08-22 23:05:15,838 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-08-22 23:05:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:15,839 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-08-22 23:05:15,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:05:15,839 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-08-22 23:05:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-22 23:05:15,840 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:15,841 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2020-08-22 23:05:15,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 23:05:15,841 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:15,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:15,841 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-08-22 23:05:15,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:15,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815539365] [2020-08-22 23:05:15,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:15,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 23:05:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 23:05:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:05:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-08-22 23:05:16,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815539365] [2020-08-22 23:05:16,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:05:16,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 23:05:16,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863950999] [2020-08-22 23:05:16,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 23:05:16,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:16,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 23:05:16,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-08-22 23:05:16,025 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-08-22 23:05:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:16,441 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-08-22 23:05:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 23:05:16,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-22 23:05:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:16,443 INFO L225 Difference]: With dead ends: 119 [2020-08-22 23:05:16,443 INFO L226 Difference]: Without dead ends: 101 [2020-08-22 23:05:16,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-08-22 23:05:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-08-22 23:05:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-08-22 23:05:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-08-22 23:05:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-08-22 23:05:16,467 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-08-22 23:05:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:16,468 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-08-22 23:05:16,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 23:05:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-08-22 23:05:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-08-22 23:05:16,469 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:16,469 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2020-08-22 23:05:16,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 23:05:16,470 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:16,470 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-08-22 23:05:16,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:16,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122147824] [2020-08-22 23:05:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 23:05:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 23:05:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 23:05:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-08-22 23:05:16,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122147824] [2020-08-22 23:05:16,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:05:16,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 23:05:16,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250995202] [2020-08-22 23:05:16,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 23:05:16,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 23:05:16,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-08-22 23:05:16,656 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-08-22 23:05:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:17,045 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-08-22 23:05:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 23:05:17,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-08-22 23:05:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:17,049 INFO L225 Difference]: With dead ends: 128 [2020-08-22 23:05:17,049 INFO L226 Difference]: Without dead ends: 126 [2020-08-22 23:05:17,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2020-08-22 23:05:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-08-22 23:05:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-08-22 23:05:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-08-22 23:05:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-08-22 23:05:17,074 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-08-22 23:05:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:17,076 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-08-22 23:05:17,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 23:05:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-08-22 23:05:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-22 23:05:17,077 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:17,077 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:05:17,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 23:05:17,078 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-08-22 23:05:17,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:17,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [57685630] [2020-08-22 23:05:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 23:05:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 23:05:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 23:05:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 23:05:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-08-22 23:05:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-08-22 23:05:17,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [57685630] [2020-08-22 23:05:17,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:05:17,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 23:05:17,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450604114] [2020-08-22 23:05:17,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 23:05:17,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 23:05:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-08-22 23:05:17,287 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-08-22 23:05:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:17,767 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-08-22 23:05:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 23:05:17,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-08-22 23:05:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:17,770 INFO L225 Difference]: With dead ends: 134 [2020-08-22 23:05:17,772 INFO L226 Difference]: Without dead ends: 132 [2020-08-22 23:05:17,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-08-22 23:05:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-08-22 23:05:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-08-22 23:05:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-08-22 23:05:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-08-22 23:05:17,791 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-08-22 23:05:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:17,791 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-08-22 23:05:17,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 23:05:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-08-22 23:05:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-08-22 23:05:17,793 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:17,793 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:05:17,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 23:05:17,793 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-08-22 23:05:17,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:17,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265881612] [2020-08-22 23:05:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:17,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 23:05:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 23:05:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 23:05:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 23:05:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-08-22 23:05:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-22 23:05:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 23:05:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2020-08-22 23:05:18,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265881612] [2020-08-22 23:05:18,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:05:18,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 23:05:18,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771735829] [2020-08-22 23:05:18,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 23:05:18,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 23:05:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:05:18,034 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-08-22 23:05:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:18,315 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-08-22 23:05:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 23:05:18,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-08-22 23:05:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:18,318 INFO L225 Difference]: With dead ends: 126 [2020-08-22 23:05:18,318 INFO L226 Difference]: Without dead ends: 109 [2020-08-22 23:05:18,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-08-22 23:05:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-08-22 23:05:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-08-22 23:05:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-08-22 23:05:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-08-22 23:05:18,334 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-08-22 23:05:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:18,334 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-08-22 23:05:18,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 23:05:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-08-22 23:05:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-08-22 23:05:18,336 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:18,336 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 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] [2020-08-22 23:05:18,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 23:05:18,337 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-08-22 23:05:18,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:18,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978404670] [2020-08-22 23:05:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 23:05:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 23:05:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 23:05:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 23:05:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:05:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-08-22 23:05:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 23:05:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-08-22 23:05:18,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1978404670] [2020-08-22 23:05:18,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:05:18,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-22 23:05:18,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123872514] [2020-08-22 23:05:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 23:05:18,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 23:05:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-08-22 23:05:18,631 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2020-08-22 23:05:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:19,218 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-08-22 23:05:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 23:05:19,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-08-22 23:05:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:19,220 INFO L225 Difference]: With dead ends: 130 [2020-08-22 23:05:19,220 INFO L226 Difference]: Without dead ends: 128 [2020-08-22 23:05:19,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2020-08-22 23:05:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-08-22 23:05:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-08-22 23:05:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-08-22 23:05:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-08-22 23:05:19,237 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-08-22 23:05:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:19,238 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-08-22 23:05:19,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 23:05:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-08-22 23:05:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-08-22 23:05:19,240 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:05:19,240 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:05:19,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 23:05:19,241 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:05:19,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:05:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-08-22 23:05:19,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:05:19,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2072335572] [2020-08-22 23:05:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:05:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:05:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 23:05:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 23:05:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 23:05:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:05:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 23:05:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 23:05:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 23:05:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 23:05:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:05:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-08-22 23:05:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 23:05:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-08-22 23:05:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-08-22 23:05:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-08-22 23:05:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-08-22 23:05:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:05:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 30 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-08-22 23:05:19,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2072335572] [2020-08-22 23:05:19,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:05:19,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-22 23:05:19,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960718346] [2020-08-22 23:05:19,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-22 23:05:19,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:05:19,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-22 23:05:19,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-08-22 23:05:19,699 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-08-22 23:05:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:05:20,320 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-08-22 23:05:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 23:05:20,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-08-22 23:05:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:05:20,322 INFO L225 Difference]: With dead ends: 117 [2020-08-22 23:05:20,322 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 23:05:20,326 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-08-22 23:05:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 23:05:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 23:05:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 23:05:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 23:05:20,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-08-22 23:05:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:05:20,328 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 23:05:20,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-22 23:05:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 23:05:20,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 23:05:20,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 23:05:20,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 23:05:21,782 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2020-08-22 23:05:21,989 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 27 [2020-08-22 23:05:22,485 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2020-08-22 23:05:22,489 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 23:05:22,489 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 23:05:22,489 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 23:05:22,489 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 23:05:22,489 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 23:05:22,489 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 23:05:22,490 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-08-22 23:05:22,490 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-08-22 23:05:22,490 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-08-22 23:05:22,490 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-08-22 23:05:22,490 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-08-22 23:05:22,490 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= 0 main_~in~0)) (.cse4 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 .cse4) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3 .cse4))) [2020-08-22 23:05:22,490 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-08-22 23:05:22,490 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 23:05:22,491 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-08-22 23:05:22,491 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 |main_#t~post5|)) [2020-08-22 23:05:22,491 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 |main_#t~post5|)) [2020-08-22 23:05:22,491 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-08-22 23:05:22,491 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~in~0 main_~buflim~0 3))) (let ((.cse0 (<= .cse5 (+ |main_#t~post3| main_~inlen~0))) (.cse6 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= 0 |main_#t~post3|)) (.cse2 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse3 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse4 (<= (+ |main_#t~post3| 1) main_~buflim~0)) (.cse7 (<= 0 main_~in~0)) (.cse8 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= 1 main_~buf~0) .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) .cse7 .cse8) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse6) .cse1 (<= 0 main_~buf~0) .cse2 .cse3 .cse4 .cse7 .cse8)))) [2020-08-22 23:05:22,492 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)) (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= 0 |main_#t~post3|) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-08-22 23:05:22,492 INFO L264 CegarLoopResult]: At program point L28(lines 28 29) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-08-22 23:05:22,492 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-08-22 23:05:22,492 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-08-22 23:05:22,492 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-08-22 23:05:22,492 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 23:05:22,492 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-08-22 23:05:22,493 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-08-22 23:05:22,493 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-08-22 23:05:22,493 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 main_~bufferlen~0)) [2020-08-22 23:05:22,493 INFO L264 CegarLoopResult]: At program point L33(lines 33 34) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-08-22 23:05:22,493 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~in~0)) [2020-08-22 23:05:22,493 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-08-22 23:05:22,493 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-08-22 23:05:22,493 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-08-22 23:05:22,493 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-08-22 23:05:22,494 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-08-22 23:05:22,494 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-08-22 23:05:22,494 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-08-22 23:05:22,494 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) .cse0) (<= main_~buf~0 main_~buflim~0) (<= 0 |main_#t~post4|) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-08-22 23:05:22,494 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 1 main_~buf~0) (<= 0 |main_#t~post4|) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-08-22 23:05:22,495 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 (<= 0 main_~in~0)) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3))) [2020-08-22 23:05:22,495 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-08-22 23:05:22,495 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 (<= 0 main_~in~0)) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3))) [2020-08-22 23:05:22,495 INFO L264 CegarLoopResult]: At program point L26-1(lines 26 37) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-08-22 23:05:22,495 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-08-22 23:05:22,495 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-08-22 23:05:22,495 INFO L264 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-08-22 23:05:22,495 INFO L264 CegarLoopResult]: At program point L26-5(lines 26 37) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-08-22 23:05:22,495 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 23:05:22,496 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-08-22 23:05:22,496 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-08-22 23:05:22,496 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-08-22 23:05:22,496 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-08-22 23:05:22,496 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-08-22 23:05:22,496 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-08-22 23:05:22,497 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 23:05:22,497 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 23:05:22,497 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 23:05:22,497 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 23:05:22,497 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 23:05:22,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 11:05:22 BoogieIcfgContainer [2020-08-22 23:05:22,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 23:05:22,522 INFO L168 Benchmark]: Toolchain (without parser) took 10879.91 ms. Allocated memory was 146.8 MB in the beginning and 318.2 MB in the end (delta: 171.4 MB). Free memory was 103.8 MB in the beginning and 184.9 MB in the end (delta: -81.1 MB). Peak memory consumption was 178.0 MB. Max. memory is 7.1 GB. [2020-08-22 23:05:22,523 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 23:05:22,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.83 ms. Allocated memory is still 146.8 MB. Free memory was 103.6 MB in the beginning and 93.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-08-22 23:05:22,524 INFO L168 Benchmark]: Boogie Preprocessor took 143.75 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 93.8 MB in the beginning and 180.9 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-08-22 23:05:22,525 INFO L168 Benchmark]: RCFGBuilder took 332.41 ms. Allocated memory is still 202.9 MB. Free memory was 180.9 MB in the beginning and 165.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-08-22 23:05:22,525 INFO L168 Benchmark]: TraceAbstraction took 10134.80 ms. Allocated memory was 202.9 MB in the beginning and 318.2 MB in the end (delta: 115.3 MB). Free memory was 164.7 MB in the beginning and 184.9 MB in the end (delta: -20.2 MB). Peak memory consumption was 182.9 MB. Max. memory is 7.1 GB. [2020-08-22 23:05:22,529 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 262.83 ms. Allocated memory is still 146.8 MB. Free memory was 103.6 MB in the beginning and 93.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.75 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 93.8 MB in the beginning and 180.9 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 332.41 ms. Allocated memory is still 202.9 MB. Free memory was 180.9 MB in the beginning and 165.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10134.80 ms. Allocated memory was 202.9 MB in the beginning and 318.2 MB in the end (delta: 115.3 MB). Free memory was 164.7 MB in the beginning and 184.9 MB in the end (delta: -20.2 MB). Peak memory consumption was 182.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((1 <= buf && buf <= buflim) && buflim + 2 <= bufferlen) && 1 <= in) && in + buflim + 3 <= buf + inlen) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && 0 <= buf) && buf <= buflim) && buflim + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 0 <= in) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.8s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 863 SDtfs, 907 SDslu, 3750 SDs, 0 SdLazy, 1792 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 911 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48419 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3947 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1018 ConstructedInterpolants, 0 QuantifiedInterpolants, 267636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 1508/1684 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...