/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:59:54,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:59:54,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:59:54,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:59:54,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:59:54,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:59:54,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:59:54,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:59:54,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:59:54,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:59:54,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:59:54,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:59:54,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:59:54,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:59:54,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:59:54,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:59:54,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:59:54,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:59:54,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:59:54,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:59:54,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:59:54,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:59:54,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:59:54,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:59:54,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:59:54,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:59:54,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:59:54,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:59:54,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:59:54,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:59:54,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:59:54,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:59:54,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:59:54,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:59:54,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:59:54,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:59:54,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:59:54,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:59:54,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:59:54,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:59:54,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:59:54,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:59:54,230 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:59:54,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:59:54,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:59:54,232 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:59:54,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:59:54,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:59:54,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:59:54,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:59:54,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:59:54,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:59:54,234 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:59:54,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:59:54,234 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:59:54,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:59:54,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:59:54,235 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:59:54,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:59:54,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:59:54,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:59:54,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:59:54,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:59:54,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:59:54,236 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:59:54,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:59:54,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:59:54,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:59:54,577 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:59:54,578 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:59:54,579 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-07 13:59:54,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f65aba41/14f77d568eb14bb78a81b2c225478e97/FLAG1da60bf54 [2020-07-07 13:59:55,144 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:59:55,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-07 13:59:55,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f65aba41/14f77d568eb14bb78a81b2c225478e97/FLAG1da60bf54 [2020-07-07 13:59:55,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f65aba41/14f77d568eb14bb78a81b2c225478e97 [2020-07-07 13:59:55,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:59:55,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:59:55,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:59:55,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:59:55,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:59:55,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b570901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55, skipping insertion in model container [2020-07-07 13:59:55,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:59:55,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:59:55,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:59:55,736 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:59:55,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:59:55,775 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:59:55,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55 WrapperNode [2020-07-07 13:59:55,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:59:55,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:59:55,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:59:55,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:59:55,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (1/1) ... [2020-07-07 13:59:55,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:59:55,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:59:55,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:59:55,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:59:55,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (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-07-07 13:59:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:59:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:59:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-07 13:59:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-07 13:59:55,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:59:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:59:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 13:59:55,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-07 13:59:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-07 13:59:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:59:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:59:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:59:55,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:59:56,247 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:59:56,248 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-07 13:59:56,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:59:56 BoogieIcfgContainer [2020-07-07 13:59:56,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:59:56,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:59:56,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:59:56,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:59:56,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:59:55" (1/3) ... [2020-07-07 13:59:56,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed9f3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:59:56, skipping insertion in model container [2020-07-07 13:59:56,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:59:55" (2/3) ... [2020-07-07 13:59:56,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed9f3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:59:56, skipping insertion in model container [2020-07-07 13:59:56,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:59:56" (3/3) ... [2020-07-07 13:59:56,264 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-07-07 13:59:56,278 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:59:56,288 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:59:56,322 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:59:56,374 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:59:56,375 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:59:56,375 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:59:56,375 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:59:56,378 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:59:56,379 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:59:56,379 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:59:56,379 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:59:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-07 13:59:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-07 13:59:56,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:56,434 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] [2020-07-07 13:59:56,434 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1441743938, now seen corresponding path program 1 times [2020-07-07 13:59:56,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:56,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535704004] [2020-07-07 13:59:56,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:59:56,704 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:56,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535704004] [2020-07-07 13:59:56,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:56,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:59:56,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036702827] [2020-07-07 13:59:56,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:59:56,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:56,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:59:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:59:56,734 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2020-07-07 13:59:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:56,944 INFO L93 Difference]: Finished difference Result 143 states and 210 transitions. [2020-07-07 13:59:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:59:56,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-07 13:59:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:56,961 INFO L225 Difference]: With dead ends: 143 [2020-07-07 13:59:56,961 INFO L226 Difference]: Without dead ends: 81 [2020-07-07 13:59:56,970 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-07-07 13:59:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-07 13:59:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2020-07-07 13:59:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-07 13:59:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2020-07-07 13:59:57,049 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 25 [2020-07-07 13:59:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:57,049 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2020-07-07 13:59:57,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:59:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2020-07-07 13:59:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-07 13:59:57,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:57,052 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] [2020-07-07 13:59:57,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:59:57,053 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1406858677, now seen corresponding path program 1 times [2020-07-07 13:59:57,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:57,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1222887290] [2020-07-07 13:59:57,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:59:57,123 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:57,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1222887290] [2020-07-07 13:59:57,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:57,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:59:57,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715235675] [2020-07-07 13:59:57,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:59:57,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:59:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:59:57,127 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 5 states. [2020-07-07 13:59:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:57,253 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2020-07-07 13:59:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:59:57,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-07 13:59:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:57,258 INFO L225 Difference]: With dead ends: 85 [2020-07-07 13:59:57,258 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 13:59:57,260 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-07-07 13:59:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 13:59:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2020-07-07 13:59:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-07 13:59:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2020-07-07 13:59:57,281 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 25 [2020-07-07 13:59:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:57,282 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2020-07-07 13:59:57,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:59:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2020-07-07 13:59:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-07 13:59:57,284 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:57,284 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] [2020-07-07 13:59:57,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:59:57,285 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1771333938, now seen corresponding path program 1 times [2020-07-07 13:59:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:57,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783143168] [2020-07-07 13:59:57,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:59:57,380 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:57,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783143168] [2020-07-07 13:59:57,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:57,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:59:57,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173667425] [2020-07-07 13:59:57,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:59:57,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:57,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:59:57,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:59:57,383 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 5 states. [2020-07-07 13:59:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:57,534 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2020-07-07 13:59:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:59:57,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-07 13:59:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:57,538 INFO L225 Difference]: With dead ends: 116 [2020-07-07 13:59:57,538 INFO L226 Difference]: Without dead ends: 114 [2020-07-07 13:59:57,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-07-07 13:59:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-07 13:59:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2020-07-07 13:59:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-07 13:59:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2020-07-07 13:59:57,562 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 30 [2020-07-07 13:59:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:57,562 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2020-07-07 13:59:57,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:59:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2020-07-07 13:59:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-07 13:59:57,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:57,564 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] [2020-07-07 13:59:57,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:59:57,564 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:57,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:57,565 INFO L82 PathProgramCache]: Analyzing trace with hash 456630219, now seen corresponding path program 1 times [2020-07-07 13:59:57,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:57,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2125614009] [2020-07-07 13:59:57,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:59:57,714 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:57,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2125614009] [2020-07-07 13:59:57,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:57,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 13:59:57,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646769626] [2020-07-07 13:59:57,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 13:59:57,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:57,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 13:59:57,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:59:57,720 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand 6 states. [2020-07-07 13:59:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:57,893 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2020-07-07 13:59:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:59:57,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-07 13:59:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:57,896 INFO L225 Difference]: With dead ends: 106 [2020-07-07 13:59:57,896 INFO L226 Difference]: Without dead ends: 104 [2020-07-07 13:59:57,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-07-07 13:59:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-07-07 13:59:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-07-07 13:59:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-07 13:59:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2020-07-07 13:59:57,918 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 35 [2020-07-07 13:59:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:57,918 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2020-07-07 13:59:57,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 13:59:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2020-07-07 13:59:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 13:59:57,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:57,920 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] [2020-07-07 13:59:57,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:59:57,921 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash 364478305, now seen corresponding path program 1 times [2020-07-07 13:59:57,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:57,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [10068782] [2020-07-07 13:59:57,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:59:58,033 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:58,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [10068782] [2020-07-07 13:59:58,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:58,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:59:58,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479368736] [2020-07-07 13:59:58,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:59:58,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:58,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:59:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:59:58,036 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand 5 states. [2020-07-07 13:59:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:58,153 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2020-07-07 13:59:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:59:58,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-07-07 13:59:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:58,158 INFO L225 Difference]: With dead ends: 135 [2020-07-07 13:59:58,158 INFO L226 Difference]: Without dead ends: 133 [2020-07-07 13:59:58,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-07-07 13:59:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-07 13:59:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2020-07-07 13:59:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-07 13:59:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2020-07-07 13:59:58,210 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 40 [2020-07-07 13:59:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:58,215 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2020-07-07 13:59:58,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:59:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2020-07-07 13:59:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-07 13:59:58,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:58,218 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] [2020-07-07 13:59:58,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:59:58,219 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash 914533499, now seen corresponding path program 1 times [2020-07-07 13:59:58,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:58,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727991981] [2020-07-07 13:59:58,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:59:58,358 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:58,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727991981] [2020-07-07 13:59:58,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:58,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:59:58,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587456066] [2020-07-07 13:59:58,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:59:58,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:58,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:59:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:59:58,361 INFO L87 Difference]: Start difference. First operand 125 states and 162 transitions. Second operand 5 states. [2020-07-07 13:59:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:58,441 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2020-07-07 13:59:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 13:59:58,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2020-07-07 13:59:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:58,445 INFO L225 Difference]: With dead ends: 229 [2020-07-07 13:59:58,445 INFO L226 Difference]: Without dead ends: 128 [2020-07-07 13:59:58,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:59:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-07 13:59:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-07-07 13:59:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-07-07 13:59:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2020-07-07 13:59:58,471 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 58 [2020-07-07 13:59:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:58,472 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2020-07-07 13:59:58,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:59:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-07 13:59:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-07 13:59:58,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:58,475 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:59:58,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:59:58,476 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1807369608, now seen corresponding path program 1 times [2020-07-07 13:59:58,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:58,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [999136993] [2020-07-07 13:59:58,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:59:58,587 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:58,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [999136993] [2020-07-07 13:59:58,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:58,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:59:58,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720108551] [2020-07-07 13:59:58,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:59:58,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:59:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:59:58,590 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand 7 states. [2020-07-07 13:59:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:58,816 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2020-07-07 13:59:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:59:58,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-07-07 13:59:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:58,819 INFO L225 Difference]: With dead ends: 136 [2020-07-07 13:59:58,819 INFO L226 Difference]: Without dead ends: 134 [2020-07-07 13:59:58,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:59:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-07 13:59:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2020-07-07 13:59:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-07 13:59:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2020-07-07 13:59:58,841 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 64 [2020-07-07 13:59:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:58,841 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2020-07-07 13:59:58,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:59:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2020-07-07 13:59:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-07 13:59:58,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:58,844 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:59:58,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:59:58,844 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:58,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1715909932, now seen corresponding path program 1 times [2020-07-07 13:59:58,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:58,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045298570] [2020-07-07 13:59:58,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:59:58,949 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:58,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045298570] [2020-07-07 13:59:58,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:58,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:59:58,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329406849] [2020-07-07 13:59:58,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:59:58,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:58,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:59:58,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:59:58,953 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand 7 states. [2020-07-07 13:59:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:59,122 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2020-07-07 13:59:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:59:59,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2020-07-07 13:59:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:59,125 INFO L225 Difference]: With dead ends: 162 [2020-07-07 13:59:59,125 INFO L226 Difference]: Without dead ends: 160 [2020-07-07 13:59:59,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-07-07 13:59:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-07 13:59:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-07-07 13:59:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-07-07 13:59:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2020-07-07 13:59:59,148 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 69 [2020-07-07 13:59:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:59,149 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2020-07-07 13:59:59,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:59:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2020-07-07 13:59:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-07 13:59:59,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:59,151 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:59:59,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:59:59,152 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1298936315, now seen corresponding path program 1 times [2020-07-07 13:59:59,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:59,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291217670] [2020-07-07 13:59:59,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-07 13:59:59,299 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:59,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291217670] [2020-07-07 13:59:59,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:59,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:59:59,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437762973] [2020-07-07 13:59:59,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:59:59,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:59,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:59:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:59:59,317 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand 7 states. [2020-07-07 13:59:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:59,545 INFO L93 Difference]: Finished difference Result 210 states and 280 transitions. [2020-07-07 13:59:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:59:59,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2020-07-07 13:59:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:59,551 INFO L225 Difference]: With dead ends: 210 [2020-07-07 13:59:59,551 INFO L226 Difference]: Without dead ends: 206 [2020-07-07 13:59:59,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-07-07 13:59:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-07 13:59:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2020-07-07 13:59:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-07-07 13:59:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 249 transitions. [2020-07-07 13:59:59,579 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 249 transitions. Word has length 71 [2020-07-07 13:59:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:59,580 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 249 transitions. [2020-07-07 13:59:59,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:59:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 249 transitions. [2020-07-07 13:59:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-07 13:59:59,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:59,582 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:59:59,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:59:59,582 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:59,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1528474552, now seen corresponding path program 1 times [2020-07-07 13:59:59,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:59,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21223984] [2020-07-07 13:59:59,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:59:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:59:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:59:59,758 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:59:59,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21223984] [2020-07-07 13:59:59,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:59:59,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 13:59:59,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802088978] [2020-07-07 13:59:59,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 13:59:59,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:59:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 13:59:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:59:59,761 INFO L87 Difference]: Start difference. First operand 188 states and 249 transitions. Second operand 8 states. [2020-07-07 13:59:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:59:59,961 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2020-07-07 13:59:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 13:59:59,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2020-07-07 13:59:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:59:59,964 INFO L225 Difference]: With dead ends: 194 [2020-07-07 13:59:59,964 INFO L226 Difference]: Without dead ends: 192 [2020-07-07 13:59:59,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-07 13:59:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-07-07 13:59:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2020-07-07 13:59:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-07-07 13:59:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2020-07-07 13:59:59,987 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 74 [2020-07-07 13:59:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:59:59,988 INFO L479 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2020-07-07 13:59:59,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 13:59:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2020-07-07 13:59:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-07 13:59:59,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:59:59,990 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 13:59:59,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:59:59,990 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:59:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:59:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1530703596, now seen corresponding path program 1 times [2020-07-07 13:59:59,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:59:59,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519951492] [2020-07-07 13:59:59,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 14:00:00,079 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:00,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519951492] [2020-07-07 14:00:00,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:00,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 14:00:00,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26365377] [2020-07-07 14:00:00,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 14:00:00,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 14:00:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 14:00:00,082 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand 7 states. [2020-07-07 14:00:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:00,236 INFO L93 Difference]: Finished difference Result 220 states and 283 transitions. [2020-07-07 14:00:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 14:00:00,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-07-07 14:00:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:00,239 INFO L225 Difference]: With dead ends: 220 [2020-07-07 14:00:00,239 INFO L226 Difference]: Without dead ends: 218 [2020-07-07 14:00:00,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-07-07 14:00:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-07-07 14:00:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2020-07-07 14:00:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-07-07 14:00:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 269 transitions. [2020-07-07 14:00:00,265 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 269 transitions. Word has length 79 [2020-07-07 14:00:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:00,265 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 269 transitions. [2020-07-07 14:00:00,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 14:00:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 269 transitions. [2020-07-07 14:00:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-07 14:00:00,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:00,267 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:00,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 14:00:00,267 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1064000984, now seen corresponding path program 1 times [2020-07-07 14:00:00,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:00,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942358498] [2020-07-07 14:00:00,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-07 14:00:00,401 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:00,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942358498] [2020-07-07 14:00:00,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:00,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 14:00:00,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530508706] [2020-07-07 14:00:00,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 14:00:00,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:00,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 14:00:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 14:00:00,405 INFO L87 Difference]: Start difference. First operand 206 states and 269 transitions. Second operand 7 states. [2020-07-07 14:00:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:00,584 INFO L93 Difference]: Finished difference Result 252 states and 330 transitions. [2020-07-07 14:00:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 14:00:00,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-07-07 14:00:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:00,587 INFO L225 Difference]: With dead ends: 252 [2020-07-07 14:00:00,587 INFO L226 Difference]: Without dead ends: 246 [2020-07-07 14:00:00,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-07-07 14:00:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-07-07 14:00:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2020-07-07 14:00:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-07-07 14:00:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2020-07-07 14:00:00,622 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 81 [2020-07-07 14:00:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:00,623 INFO L479 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2020-07-07 14:00:00,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 14:00:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2020-07-07 14:00:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-07 14:00:00,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:00,625 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 14:00:00,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 14:00:00,626 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash -895183749, now seen corresponding path program 1 times [2020-07-07 14:00:00,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:00,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404906415] [2020-07-07 14:00:00,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 14:00:00,764 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:00,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404906415] [2020-07-07 14:00:00,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:00,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 14:00:00,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423082886] [2020-07-07 14:00:00,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 14:00:00,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 14:00:00,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-07 14:00:00,767 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand 10 states. [2020-07-07 14:00:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:01,066 INFO L93 Difference]: Finished difference Result 236 states and 307 transitions. [2020-07-07 14:00:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 14:00:01,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-07-07 14:00:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:01,069 INFO L225 Difference]: With dead ends: 236 [2020-07-07 14:00:01,069 INFO L226 Difference]: Without dead ends: 234 [2020-07-07 14:00:01,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2020-07-07 14:00:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-07-07 14:00:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2020-07-07 14:00:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-07-07 14:00:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 305 transitions. [2020-07-07 14:00:01,095 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 305 transitions. Word has length 90 [2020-07-07 14:00:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:01,095 INFO L479 AbstractCegarLoop]: Abstraction has 234 states and 305 transitions. [2020-07-07 14:00:01,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 14:00:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 305 transitions. [2020-07-07 14:00:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-07-07 14:00:01,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:01,097 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 14:00:01,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 14:00:01,098 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1272604239, now seen corresponding path program 1 times [2020-07-07 14:00:01,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:01,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823357272] [2020-07-07 14:00:01,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 14:00:01,241 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:01,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823357272] [2020-07-07 14:00:01,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:01,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:00:01,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548013790] [2020-07-07 14:00:01,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:00:01,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:01,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:00:01,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:00:01,245 INFO L87 Difference]: Start difference. First operand 234 states and 305 transitions. Second operand 9 states. [2020-07-07 14:00:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:01,467 INFO L93 Difference]: Finished difference Result 262 states and 335 transitions. [2020-07-07 14:00:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 14:00:01,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2020-07-07 14:00:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:01,471 INFO L225 Difference]: With dead ends: 262 [2020-07-07 14:00:01,471 INFO L226 Difference]: Without dead ends: 260 [2020-07-07 14:00:01,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 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-07-07 14:00:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-07-07 14:00:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2020-07-07 14:00:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-07-07 14:00:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 318 transitions. [2020-07-07 14:00:01,496 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 318 transitions. Word has length 95 [2020-07-07 14:00:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:01,497 INFO L479 AbstractCegarLoop]: Abstraction has 246 states and 318 transitions. [2020-07-07 14:00:01,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:00:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2020-07-07 14:00:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-07-07 14:00:01,499 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:01,499 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:01,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 14:00:01,499 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash -960498755, now seen corresponding path program 1 times [2020-07-07 14:00:01,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:01,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573699928] [2020-07-07 14:00:01,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 14:00:01,611 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:01,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573699928] [2020-07-07 14:00:01,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:01,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:00:01,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946948490] [2020-07-07 14:00:01,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:00:01,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:01,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:00:01,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:00:01,614 INFO L87 Difference]: Start difference. First operand 246 states and 318 transitions. Second operand 9 states. [2020-07-07 14:00:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:01,887 INFO L93 Difference]: Finished difference Result 293 states and 378 transitions. [2020-07-07 14:00:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 14:00:01,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2020-07-07 14:00:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:01,891 INFO L225 Difference]: With dead ends: 293 [2020-07-07 14:00:01,891 INFO L226 Difference]: Without dead ends: 291 [2020-07-07 14:00:01,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 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-07-07 14:00:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-07 14:00:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 270. [2020-07-07 14:00:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-07 14:00:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 349 transitions. [2020-07-07 14:00:01,918 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 349 transitions. Word has length 110 [2020-07-07 14:00:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:01,919 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 349 transitions. [2020-07-07 14:00:01,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:00:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2020-07-07 14:00:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-07-07 14:00:01,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:01,921 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:01,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 14:00:01,921 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1038471395, now seen corresponding path program 1 times [2020-07-07 14:00:01,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:01,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884691317] [2020-07-07 14:00:01,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-07 14:00:02,045 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:02,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884691317] [2020-07-07 14:00:02,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:02,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:00:02,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249367322] [2020-07-07 14:00:02,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:00:02,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:00:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:00:02,048 INFO L87 Difference]: Start difference. First operand 270 states and 349 transitions. Second operand 9 states. [2020-07-07 14:00:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:02,374 INFO L93 Difference]: Finished difference Result 372 states and 494 transitions. [2020-07-07 14:00:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 14:00:02,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2020-07-07 14:00:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:02,378 INFO L225 Difference]: With dead ends: 372 [2020-07-07 14:00:02,378 INFO L226 Difference]: Without dead ends: 368 [2020-07-07 14:00:02,379 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-07-07 14:00:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2020-07-07 14:00:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 345. [2020-07-07 14:00:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-07-07 14:00:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 458 transitions. [2020-07-07 14:00:02,417 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 458 transitions. Word has length 110 [2020-07-07 14:00:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:02,418 INFO L479 AbstractCegarLoop]: Abstraction has 345 states and 458 transitions. [2020-07-07 14:00:02,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:00:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 458 transitions. [2020-07-07 14:00:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-07-07 14:00:02,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:02,423 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:02,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-07 14:00:02,423 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1539222205, now seen corresponding path program 1 times [2020-07-07 14:00:02,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:02,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041756154] [2020-07-07 14:00:02,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 14:00:02,550 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:02,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041756154] [2020-07-07 14:00:02,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:02,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:00:02,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716162998] [2020-07-07 14:00:02,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:00:02,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:00:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:00:02,553 INFO L87 Difference]: Start difference. First operand 345 states and 458 transitions. Second operand 9 states. [2020-07-07 14:00:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:02,808 INFO L93 Difference]: Finished difference Result 379 states and 496 transitions. [2020-07-07 14:00:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 14:00:02,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2020-07-07 14:00:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:02,812 INFO L225 Difference]: With dead ends: 379 [2020-07-07 14:00:02,812 INFO L226 Difference]: Without dead ends: 377 [2020-07-07 14:00:02,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 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-07-07 14:00:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-07-07 14:00:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2020-07-07 14:00:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-07-07 14:00:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2020-07-07 14:00:02,849 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 120 [2020-07-07 14:00:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:02,849 INFO L479 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2020-07-07 14:00:02,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:00:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2020-07-07 14:00:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-07-07 14:00:02,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:02,852 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:02,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-07 14:00:02,853 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash 871752502, now seen corresponding path program 1 times [2020-07-07 14:00:02,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:02,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644015736] [2020-07-07 14:00:02,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-07 14:00:03,056 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:03,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644015736] [2020-07-07 14:00:03,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:03,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 14:00:03,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368922980] [2020-07-07 14:00:03,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 14:00:03,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:03,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 14:00:03,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-07 14:00:03,059 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 11 states. [2020-07-07 14:00:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:03,407 INFO L93 Difference]: Finished difference Result 424 states and 562 transitions. [2020-07-07 14:00:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 14:00:03,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 120 [2020-07-07 14:00:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:03,414 INFO L225 Difference]: With dead ends: 424 [2020-07-07 14:00:03,414 INFO L226 Difference]: Without dead ends: 418 [2020-07-07 14:00:03,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-07-07 14:00:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-07-07 14:00:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2020-07-07 14:00:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-07-07 14:00:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 529 transitions. [2020-07-07 14:00:03,462 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 529 transitions. Word has length 120 [2020-07-07 14:00:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:03,463 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 529 transitions. [2020-07-07 14:00:03,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 14:00:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 529 transitions. [2020-07-07 14:00:03,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-07-07 14:00:03,465 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:03,466 INFO L422 BasicCegarLoop]: trace histogram [18, 17, 17, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:03,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-07 14:00:03,466 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:03,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:03,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1668448602, now seen corresponding path program 1 times [2020-07-07 14:00:03,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:03,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945863416] [2020-07-07 14:00:03,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 14:00:03,679 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:03,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945863416] [2020-07-07 14:00:03,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:03,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 14:00:03,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762607871] [2020-07-07 14:00:03,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 14:00:03,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:03,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 14:00:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-07 14:00:03,683 INFO L87 Difference]: Start difference. First operand 398 states and 529 transitions. Second operand 11 states. [2020-07-07 14:00:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:04,140 INFO L93 Difference]: Finished difference Result 432 states and 566 transitions. [2020-07-07 14:00:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 14:00:04,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2020-07-07 14:00:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:04,147 INFO L225 Difference]: With dead ends: 432 [2020-07-07 14:00:04,147 INFO L226 Difference]: Without dead ends: 430 [2020-07-07 14:00:04,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-07 14:00:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-07-07 14:00:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2020-07-07 14:00:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-07-07 14:00:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 542 transitions. [2020-07-07 14:00:04,211 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 542 transitions. Word has length 136 [2020-07-07 14:00:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:04,212 INFO L479 AbstractCegarLoop]: Abstraction has 410 states and 542 transitions. [2020-07-07 14:00:04,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 14:00:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 542 transitions. [2020-07-07 14:00:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-07-07 14:00:04,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:04,217 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:04,218 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-07 14:00:04,218 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:04,219 INFO L82 PathProgramCache]: Analyzing trace with hash 362381850, now seen corresponding path program 1 times [2020-07-07 14:00:04,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:04,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853791069] [2020-07-07 14:00:04,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-07 14:00:04,537 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:04,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853791069] [2020-07-07 14:00:04,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:04,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 14:00:04,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120059923] [2020-07-07 14:00:04,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 14:00:04,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 14:00:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-07 14:00:04,541 INFO L87 Difference]: Start difference. First operand 410 states and 542 transitions. Second operand 11 states. [2020-07-07 14:00:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:05,041 INFO L93 Difference]: Finished difference Result 645 states and 888 transitions. [2020-07-07 14:00:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 14:00:05,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2020-07-07 14:00:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:05,049 INFO L225 Difference]: With dead ends: 645 [2020-07-07 14:00:05,049 INFO L226 Difference]: Without dead ends: 639 [2020-07-07 14:00:05,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2020-07-07 14:00:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-07-07 14:00:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 572. [2020-07-07 14:00:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-07-07 14:00:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 778 transitions. [2020-07-07 14:00:05,111 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 778 transitions. Word has length 151 [2020-07-07 14:00:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:05,112 INFO L479 AbstractCegarLoop]: Abstraction has 572 states and 778 transitions. [2020-07-07 14:00:05,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 14:00:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 778 transitions. [2020-07-07 14:00:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-07-07 14:00:05,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:05,115 INFO L422 BasicCegarLoop]: trace histogram [20, 19, 19, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:00:05,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-07 14:00:05,116 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash -978309232, now seen corresponding path program 2 times [2020-07-07 14:00:05,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:05,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [111731303] [2020-07-07 14:00:05,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-07 14:00:05,284 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:05,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [111731303] [2020-07-07 14:00:05,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:05,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 14:00:05,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116890755] [2020-07-07 14:00:05,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 14:00:05,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 14:00:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-07 14:00:05,287 INFO L87 Difference]: Start difference. First operand 572 states and 778 transitions. Second operand 11 states. [2020-07-07 14:00:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:05,873 INFO L93 Difference]: Finished difference Result 647 states and 885 transitions. [2020-07-07 14:00:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 14:00:05,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2020-07-07 14:00:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:05,882 INFO L225 Difference]: With dead ends: 647 [2020-07-07 14:00:05,882 INFO L226 Difference]: Without dead ends: 641 [2020-07-07 14:00:05,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2020-07-07 14:00:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-07-07 14:00:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 412. [2020-07-07 14:00:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-07-07 14:00:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 539 transitions. [2020-07-07 14:00:05,958 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 539 transitions. Word has length 151 [2020-07-07 14:00:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:05,959 INFO L479 AbstractCegarLoop]: Abstraction has 412 states and 539 transitions. [2020-07-07 14:00:05,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 14:00:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 539 transitions. [2020-07-07 14:00:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-07-07 14:00:05,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:05,963 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 14:00:05,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-07 14:00:05,963 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:05,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1688386477, now seen corresponding path program 1 times [2020-07-07 14:00:05,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:05,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580904381] [2020-07-07 14:00:05,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-07 14:00:06,201 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:06,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580904381] [2020-07-07 14:00:06,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:06,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 14:00:06,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186918683] [2020-07-07 14:00:06,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 14:00:06,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 14:00:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-07 14:00:06,206 INFO L87 Difference]: Start difference. First operand 412 states and 539 transitions. Second operand 13 states. [2020-07-07 14:00:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:06,723 INFO L93 Difference]: Finished difference Result 505 states and 669 transitions. [2020-07-07 14:00:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 14:00:06,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2020-07-07 14:00:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:06,729 INFO L225 Difference]: With dead ends: 505 [2020-07-07 14:00:06,730 INFO L226 Difference]: Without dead ends: 495 [2020-07-07 14:00:06,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2020-07-07 14:00:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-07-07 14:00:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 459. [2020-07-07 14:00:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2020-07-07 14:00:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 603 transitions. [2020-07-07 14:00:06,810 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 603 transitions. Word has length 161 [2020-07-07 14:00:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:06,811 INFO L479 AbstractCegarLoop]: Abstraction has 459 states and 603 transitions. [2020-07-07 14:00:06,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 14:00:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 603 transitions. [2020-07-07 14:00:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-07-07 14:00:06,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:00:06,816 INFO L422 BasicCegarLoop]: trace histogram [22, 21, 21, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-07 14:00:06,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-07 14:00:06,817 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:00:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:00:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1620079197, now seen corresponding path program 2 times [2020-07-07 14:00:06,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:00:06,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675550444] [2020-07-07 14:00:06,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:00:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:00:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-07 14:00:07,042 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:00:07,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675550444] [2020-07-07 14:00:07,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:00:07,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 14:00:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261171203] [2020-07-07 14:00:07,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 14:00:07,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:00:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 14:00:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-07 14:00:07,044 INFO L87 Difference]: Start difference. First operand 459 states and 603 transitions. Second operand 13 states. [2020-07-07 14:00:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:00:07,569 INFO L93 Difference]: Finished difference Result 499 states and 659 transitions. [2020-07-07 14:00:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 14:00:07,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2020-07-07 14:00:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:00:07,571 INFO L225 Difference]: With dead ends: 499 [2020-07-07 14:00:07,571 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 14:00:07,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2020-07-07 14:00:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 14:00:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 14:00:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 14:00:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 14:00:07,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2020-07-07 14:00:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:00:07,575 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 14:00:07,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 14:00:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 14:00:07,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 14:00:07,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-07 14:00:07,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 14:00:08,403 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 41 [2020-07-07 14:00:09,046 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 66 [2020-07-07 14:00:09,714 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 23 [2020-07-07 14:00:10,023 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 25 [2020-07-07 14:00:10,366 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2020-07-07 14:00:10,472 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 22 [2020-07-07 14:00:10,830 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 23 [2020-07-07 14:00:11,478 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 16 [2020-07-07 14:00:11,916 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 23 [2020-07-07 14:00:12,293 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 11 [2020-07-07 14:00:12,492 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 16 [2020-07-07 14:00:13,198 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 26 [2020-07-07 14:00:13,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 14:00:13,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 14:00:13,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 14:00:13,324 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 14:00:13,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 14:00:13,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 14:00:13,324 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-07 14:00:13,325 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-07 14:00:13,325 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-07 14:00:13,325 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-07 14:00:13,325 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-07 14:00:13,325 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,325 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,326 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 56) the Hoare annotation is: true [2020-07-07 14:00:13,326 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (<= (+ main_~limit~0 4) main_~bufsize~0) [2020-07-07 14:00:13,326 INFO L264 CegarLoopResult]: At program point L23-3(lines 23 54) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 0 main_~i~0) .cse0) (and .cse0 (<= main_~len~0 main_~i~0)))) [2020-07-07 14:00:13,326 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-07 14:00:13,326 INFO L271 CegarLoopResult]: At program point L23-4(lines 23 54) the Hoare annotation is: true [2020-07-07 14:00:13,326 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-07-07 14:00:13,326 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-07-07 14:00:13,327 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse1 (< main_~i~0 main_~len~0)) (.cse3 (<= 0 main_~j~0)) (.cse2 (<= (+ main_~j~0 5) main_~bufsize~0))) (or (and (<= 0 main_~i~0) .cse0 .cse1 .cse2 .cse3) (and (<= main_~len~0 (+ main_~i~0 1)) .cse0 .cse1 .cse3 .cse2))) [2020-07-07 14:00:13,327 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,327 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 |main_#t~post6|) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,327 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= 2 main_~i~0) (<= 1 |main_#t~post6|) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0)) [2020-07-07 14:00:13,327 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,327 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,328 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,328 INFO L264 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,328 INFO L264 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,328 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< main_~i~0 main_~len~0)) [2020-07-07 14:00:13,328 INFO L264 CegarLoopResult]: At program point L24-3(lines 24 53) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 0 main_~i~0) .cse0 (<= 0 main_~j~0)) (and .cse0 (<= main_~len~0 main_~i~0)))) [2020-07-07 14:00:13,328 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-07 14:00:13,328 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-07 14:00:13,329 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 1)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse2 (<= (+ main_~j~0 5) main_~bufsize~0))) (or (and (<= main_~len~0 .cse0) .cse1 (< main_~i~0 main_~len~0) .cse2) (and (<= 0 main_~i~0) (< .cse0 main_~len~0) .cse1 .cse2 (<= 0 main_~j~0)))) [2020-07-07 14:00:13,329 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-07 14:00:13,329 INFO L264 CegarLoopResult]: At program point L45(lines 25 52) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,329 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0)) [2020-07-07 14:00:13,329 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0)) [2020-07-07 14:00:13,329 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,329 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~i~0) (<= 0 |main_#t~post3|) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ |main_#t~post3| 5) main_~bufsize~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,329 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (and (<= 0 main_~i~0) (<= 1 main_~j~0) (<= 0 |main_#t~post3|) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ |main_#t~post3| 5) main_~bufsize~0)) [2020-07-07 14:00:13,330 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,330 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,330 INFO L264 CegarLoopResult]: At program point L25(lines 25 52) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,330 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-07 14:00:13,330 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-07 14:00:13,330 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-07 14:00:13,330 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 1)) (.cse1 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse2 (<= (+ main_~j~0 5) main_~bufsize~0))) (or (and (<= 0 main_~i~0) (<= 0 |main_#t~post8|) (< .cse0 main_~len~0) .cse1 .cse2 (<= 0 main_~j~0)) (and (<= main_~len~0 .cse0) .cse1 (< main_~i~0 main_~len~0) .cse2))) [2020-07-07 14:00:13,330 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-07 14:00:13,330 INFO L264 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse1 (< main_~i~0 main_~len~0))) (or (and (<= 0 main_~i~0) (<= 0 |main_#t~post8|) (<= 1 main_~j~0) .cse0 .cse1) (and (<= main_~len~0 (+ main_~i~0 1)) .cse0 .cse1))) [2020-07-07 14:00:13,330 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,331 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 56) the Hoare annotation is: true [2020-07-07 14:00:13,331 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0)) [2020-07-07 14:00:13,331 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,331 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~i~0) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0)) [2020-07-07 14:00:13,331 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ |main_#t~post4| 2) main_~len~0) (<= 0 |main_#t~post4|) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0)) [2020-07-07 14:00:13,331 INFO L264 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= (+ |main_#t~post4| 2) main_~len~0) (<= 0 |main_#t~post4|) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,331 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,331 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 56) the Hoare annotation is: true [2020-07-07 14:00:13,332 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,332 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (< (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 5) main_~bufsize~0)) [2020-07-07 14:00:13,332 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-07 14:00:13,332 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse1 (< main_~i~0 main_~len~0))) (or (and (<= main_~len~0 (+ main_~i~0 1)) .cse0 .cse1) (and (<= 0 main_~i~0) (<= 1 main_~j~0) .cse0 .cse1))) [2020-07-07 14:00:13,332 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-07 14:00:13,332 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 1)) (.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 0 main_~i~0) (<= 1 main_~j~0) (<= 0 |main_#t~post9|) .cse0 (< .cse1 main_~len~0)) (and (<= main_~len~0 .cse1) .cse0 (<= main_~len~0 (+ |main_#t~post9| 1)) (< main_~i~0 main_~len~0)))) [2020-07-07 14:00:13,333 INFO L264 CegarLoopResult]: At program point L51-2(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0))) (or (and (<= 1 main_~j~0) (<= 0 |main_#t~post9|) .cse0 (<= 1 main_~i~0)) (and .cse0 (<= main_~len~0 (+ |main_#t~post9| 1)) (<= main_~len~0 main_~i~0)))) [2020-07-07 14:00:13,333 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (<= (+ main_~limit~0 4) main_~bufsize~0)) (.cse1 (< main_~i~0 main_~len~0)) (.cse3 (<= 0 main_~j~0)) (.cse2 (<= (+ main_~j~0 5) main_~bufsize~0))) (or (and (<= 0 main_~i~0) .cse0 .cse1 .cse2 .cse3) (and (<= main_~len~0 (+ main_~i~0 1)) .cse0 .cse1 .cse3 .cse2))) [2020-07-07 14:00:13,333 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= 2 |main_#t~post7|) (<= 2 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0)) [2020-07-07 14:00:13,333 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (<= 2 |main_#t~post7|) (<= 2 main_~i~0) (<= 3 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2020-07-07 14:00:13,333 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 |main_#t~post5|) (<= 1 main_~j~0) (<= (+ |main_#t~post5| 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,333 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 |main_#t~post5|) (<= (+ |main_#t~post5| 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= 2 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,333 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,334 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 1 main_~j~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 1 main_~i~0)) [2020-07-07 14:00:13,334 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-07 14:00:13,334 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 14:00:13,334 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 14:00:13,334 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 14:00:13,334 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 14:00:13,334 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 14:00:13,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 02:00:13 BoogieIcfgContainer [2020-07-07 14:00:13,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 14:00:13,359 INFO L168 Benchmark]: Toolchain (without parser) took 17858.94 ms. Allocated memory was 136.8 MB in the beginning and 445.6 MB in the end (delta: 308.8 MB). Free memory was 102.4 MB in the beginning and 124.7 MB in the end (delta: -22.3 MB). Peak memory consumption was 327.0 MB. Max. memory is 7.1 GB. [2020-07-07 14:00:13,360 INFO L168 Benchmark]: CDTParser took 1.10 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 14:00:13,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.88 ms. Allocated memory is still 136.8 MB. Free memory was 102.2 MB in the beginning and 92.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-07 14:00:13,361 INFO L168 Benchmark]: Boogie Preprocessor took 126.03 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 92.0 MB in the beginning and 179.6 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-07 14:00:13,362 INFO L168 Benchmark]: RCFGBuilder took 353.42 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 161.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2020-07-07 14:00:13,362 INFO L168 Benchmark]: TraceAbstraction took 17100.46 ms. Allocated memory was 200.8 MB in the beginning and 445.6 MB in the end (delta: 244.8 MB). Free memory was 160.4 MB in the beginning and 124.7 MB in the end (delta: 35.7 MB). Peak memory consumption was 321.1 MB. Max. memory is 7.1 GB. [2020-07-07 14:00:13,365 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.88 ms. Allocated memory is still 136.8 MB. Free memory was 102.2 MB in the beginning and 92.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.03 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 92.0 MB in the beginning and 179.6 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.42 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 161.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17100.46 ms. Allocated memory was 200.8 MB in the beginning and 445.6 MB in the end (delta: 244.8 MB). Free memory was 160.4 MB in the beginning and 124.7 MB in the end (delta: 35.7 MB). Peak memory consumption was 321.1 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: 25]: Loop Invariant Derived loop invariant: (((0 <= i && limit + 4 <= bufsize) && 0 <= j) && i < len) && j + 5 <= bufsize - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (0 <= i && limit + 4 <= bufsize) || (limit + 4 <= bufsize && len <= i) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((0 <= i && limit + 4 <= bufsize) && 0 <= j) || (limit + 4 <= bufsize && len <= i) - 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: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.2s, OverallIterations: 23, TraceHistogramMax: 22, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2525 SDtfs, 852 SDslu, 11733 SDs, 0 SdLazy, 3758 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 811 GetRequests, 554 SyntacticMatches, 1 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=572occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 542 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 1484 PreInvPairs, 2305 NumberOfFragments, 1184 HoareAnnotationTreeSize, 1484 FomulaSimplifications, 3717359 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 74 FomulaSimplificationsInter, 276596 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...