/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_15x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:22:27,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:22:27,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:22:27,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:22:27,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:22:27,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:22:27,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:22:27,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:22:27,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:22:27,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:22:27,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:22:27,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:22:27,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:22:27,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:22:27,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:22:27,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:22:27,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:22:27,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:22:27,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:22:27,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:22:27,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:22:27,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:22:27,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:22:27,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:22:27,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:22:27,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:22:27,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:22:27,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:22:27,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:22:27,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:22:27,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:22:27,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:22:27,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:22:27,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:22:27,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:22:27,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:22:27,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:22:27,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:22:27,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:22:27,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:22:27,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:22:27,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:22:27,616 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:22:27,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:22:27,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:22:27,619 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:22:27,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:22:27,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:22:27,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:22:27,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:22:27,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:22:27,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:22:27,620 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:22:27,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:22:27,620 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:22:27,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:22:27,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:22:27,621 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:22:27,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:22:27,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:22:27,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:22:27,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:22:27,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:22:27,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:22:27,623 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:22:27,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:22:27,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:22:27,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:22:27,904 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:22:27,905 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:22:27,906 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-07-17 17:22:27,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8ece9c7/3efae062537d468291ede585f67eb933/FLAG48d778943 [2020-07-17 17:22:28,440 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:22:28,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-07-17 17:22:28,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8ece9c7/3efae062537d468291ede585f67eb933/FLAG48d778943 [2020-07-17 17:22:28,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8ece9c7/3efae062537d468291ede585f67eb933 [2020-07-17 17:22:28,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:22:28,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:22:28,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:28,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:22:28,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:22:28,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:28" (1/1) ... [2020-07-17 17:22:28,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f2ddd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:28, skipping insertion in model container [2020-07-17 17:22:28,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:22:28" (1/1) ... [2020-07-17 17:22:28,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:22:28,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:22:29,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:29,055 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:22:29,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:22:29,086 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:22:29,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29 WrapperNode [2020-07-17 17:22:29,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:22:29,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:22:29,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:22:29,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:22:29,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (1/1) ... [2020-07-17 17:22:29,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (1/1) ... [2020-07-17 17:22:29,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (1/1) ... [2020-07-17 17:22:29,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (1/1) ... [2020-07-17 17:22:29,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (1/1) ... [2020-07-17 17:22:29,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (1/1) ... [2020-07-17 17:22:29,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (1/1) ... [2020-07-17 17:22:29,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:22:29,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:22:29,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:22:29,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:22:29,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (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-17 17:22:29,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:22:29,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:22:29,269 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-17 17:22:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:22:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:22:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-17 17:22:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:22:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:22:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:22:29,462 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:22:29,462 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:22:29,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:29 BoogieIcfgContainer [2020-07-17 17:22:29,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:22:29,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:22:29,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:22:29,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:22:29,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:22:28" (1/3) ... [2020-07-17 17:22:29,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8e5034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:29, skipping insertion in model container [2020-07-17 17:22:29,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:22:29" (2/3) ... [2020-07-17 17:22:29,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8e5034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:22:29, skipping insertion in model container [2020-07-17 17:22:29,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:22:29" (3/3) ... [2020-07-17 17:22:29,475 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2020-07-17 17:22:29,486 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:22:29,494 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:22:29,510 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:22:29,539 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:22:29,540 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:22:29,540 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:22:29,540 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:22:29,540 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:22:29,540 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:22:29,540 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:22:29,541 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:22:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-17 17:22:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 17:22:29,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:29,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:29,599 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:29,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-17 17:22:29,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:29,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973127036] [2020-07-17 17:22:29,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:29,845 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-17 17:22:29,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973127036] [2020-07-17 17:22:29,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:22:29,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:22:29,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267778357] [2020-07-17 17:22:29,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:22:29,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:22:29,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:22:29,873 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-17 17:22:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:29,985 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-17 17:22:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:22:29,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 17:22:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:29,999 INFO L225 Difference]: With dead ends: 39 [2020-07-17 17:22:29,999 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 17:22:30,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-17 17:22:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 17:22:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-17 17:22:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 17:22:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-17 17:22:30,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-17 17:22:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:30,057 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-17 17:22:30,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:22:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-17 17:22:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 17:22:30,060 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:30,060 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:30,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:22:30,061 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-17 17:22:30,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:30,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398049508] [2020-07-17 17:22:30,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 17:22:30,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398049508] [2020-07-17 17:22:30,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:30,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:22:30,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149798485] [2020-07-17 17:22:30,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:22:30,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:22:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:22:30,249 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-07-17 17:22:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:30,328 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-17 17:22:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:22:30,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 17:22:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:30,331 INFO L225 Difference]: With dead ends: 36 [2020-07-17 17:22:30,331 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:22:30,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:22:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:22:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 17:22:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:22:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-17 17:22:30,345 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-17 17:22:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:30,346 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-17 17:22:30,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:22:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-17 17:22:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 17:22:30,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:30,348 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:30,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:22:30,348 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-17 17:22:30,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:30,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645049842] [2020-07-17 17:22:30,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-17 17:22:30,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1645049842] [2020-07-17 17:22:30,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:30,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:22:30,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764016975] [2020-07-17 17:22:30,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:22:30,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:22:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:22:30,517 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-07-17 17:22:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:30,604 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-07-17 17:22:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:22:30,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 17:22:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:30,606 INFO L225 Difference]: With dead ends: 41 [2020-07-17 17:22:30,607 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 17:22:30,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:22:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 17:22:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 17:22:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 17:22:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-17 17:22:30,620 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-07-17 17:22:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:30,621 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-17 17:22:30,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:22:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-17 17:22:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-17 17:22:30,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:30,623 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:30,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:22:30,624 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-07-17 17:22:30,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:30,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12177759] [2020-07-17 17:22:30,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-17 17:22:30,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12177759] [2020-07-17 17:22:30,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:30,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:22:30,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044736200] [2020-07-17 17:22:30,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:22:30,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:30,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:22:30,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:22:30,907 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-07-17 17:22:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:30,982 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-17 17:22:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:22:30,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-17 17:22:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:30,985 INFO L225 Difference]: With dead ends: 46 [2020-07-17 17:22:30,985 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 17:22:30,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 17:22:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 17:22:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 17:22:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-07-17 17:22:30,996 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-07-17 17:22:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:30,997 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-07-17 17:22:30,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:22:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-17 17:22:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 17:22:30,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:30,999 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:30,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:22:31,000 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:31,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-07-17 17:22:31,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:31,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901906850] [2020-07-17 17:22:31,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-07-17 17:22:31,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901906850] [2020-07-17 17:22:31,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:31,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 17:22:31,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703091426] [2020-07-17 17:22:31,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 17:22:31,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 17:22:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:22:31,190 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-07-17 17:22:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:31,300 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-17 17:22:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:22:31,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-07-17 17:22:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:31,303 INFO L225 Difference]: With dead ends: 51 [2020-07-17 17:22:31,303 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 17:22:31,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:22:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 17:22:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-17 17:22:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 17:22:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-07-17 17:22:31,331 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-07-17 17:22:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:31,332 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-07-17 17:22:31,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 17:22:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-07-17 17:22:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-17 17:22:31,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:31,336 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:31,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:22:31,337 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-07-17 17:22:31,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:31,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [867388455] [2020-07-17 17:22:31,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-17 17:22:31,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [867388455] [2020-07-17 17:22:31,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:31,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:22:31,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445666701] [2020-07-17 17:22:31,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:22:31,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:31,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:22:31,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:22:31,546 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-07-17 17:22:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:31,659 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-17 17:22:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:22:31,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-07-17 17:22:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:31,661 INFO L225 Difference]: With dead ends: 56 [2020-07-17 17:22:31,662 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 17:22:31,663 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:22:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 17:22:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-17 17:22:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 17:22:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-07-17 17:22:31,674 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-07-17 17:22:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:31,675 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-07-17 17:22:31,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:22:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-07-17 17:22:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-17 17:22:31,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:31,677 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:31,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:22:31,678 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:31,678 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-07-17 17:22:31,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:31,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596332920] [2020-07-17 17:22:31,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-17 17:22:31,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596332920] [2020-07-17 17:22:31,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:31,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:22:31,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030510384] [2020-07-17 17:22:31,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:22:31,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:22:31,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:22:31,899 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-07-17 17:22:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:32,023 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-07-17 17:22:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:22:32,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-07-17 17:22:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:32,028 INFO L225 Difference]: With dead ends: 61 [2020-07-17 17:22:32,028 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 17:22:32,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:22:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 17:22:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 17:22:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 17:22:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-07-17 17:22:32,043 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-07-17 17:22:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:32,044 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-07-17 17:22:32,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:22:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-07-17 17:22:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-17 17:22:32,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:32,045 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:32,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:22:32,046 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-07-17 17:22:32,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:32,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130408547] [2020-07-17 17:22:32,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-17 17:22:32,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130408547] [2020-07-17 17:22:32,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:32,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:22:32,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3510869] [2020-07-17 17:22:32,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:22:32,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:22:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:22:32,376 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-07-17 17:22:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:32,512 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-07-17 17:22:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:22:32,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-07-17 17:22:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:32,514 INFO L225 Difference]: With dead ends: 66 [2020-07-17 17:22:32,515 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 17:22:32,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-07-17 17:22:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 17:22:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-17 17:22:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-17 17:22:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-07-17 17:22:32,526 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-07-17 17:22:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:32,526 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-07-17 17:22:32,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:22:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-07-17 17:22:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-17 17:22:32,528 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:32,529 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:32,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:22:32,529 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-07-17 17:22:32,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:32,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446134302] [2020-07-17 17:22:32,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-07-17 17:22:32,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446134302] [2020-07-17 17:22:32,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:32,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 17:22:32,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975899514] [2020-07-17 17:22:32,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:22:32,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:22:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:22:32,843 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-07-17 17:22:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:32,994 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-07-17 17:22:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 17:22:32,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-07-17 17:22:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:32,996 INFO L225 Difference]: With dead ends: 71 [2020-07-17 17:22:32,996 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 17:22:32,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:22:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 17:22:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-17 17:22:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-17 17:22:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-07-17 17:22:33,007 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-07-17 17:22:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:33,008 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-07-17 17:22:33,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:22:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-07-17 17:22:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-17 17:22:33,009 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:33,009 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:33,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:22:33,010 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:33,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-07-17 17:22:33,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:33,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2122020680] [2020-07-17 17:22:33,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-07-17 17:22:33,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2122020680] [2020-07-17 17:22:33,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:33,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:22:33,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69355352] [2020-07-17 17:22:33,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:22:33,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:22:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:22:33,346 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-07-17 17:22:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:33,505 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-07-17 17:22:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:22:33,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-07-17 17:22:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:33,507 INFO L225 Difference]: With dead ends: 76 [2020-07-17 17:22:33,507 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:22:33,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-07-17 17:22:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:22:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 17:22:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:22:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-07-17 17:22:33,520 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-07-17 17:22:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:33,520 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-07-17 17:22:33,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:22:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-07-17 17:22:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-17 17:22:33,522 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:33,522 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:33,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:22:33,523 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-07-17 17:22:33,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:33,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1707006568] [2020-07-17 17:22:33,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-07-17 17:22:33,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1707006568] [2020-07-17 17:22:33,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:33,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:22:33,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362829023] [2020-07-17 17:22:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:22:33,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:22:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:22:33,909 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-07-17 17:22:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:34,102 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-07-17 17:22:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 17:22:34,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-07-17 17:22:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:34,115 INFO L225 Difference]: With dead ends: 81 [2020-07-17 17:22:34,115 INFO L226 Difference]: Without dead ends: 75 [2020-07-17 17:22:34,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-07-17 17:22:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-17 17:22:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-17 17:22:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-17 17:22:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-07-17 17:22:34,130 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-07-17 17:22:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:34,131 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-07-17 17:22:34,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:22:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-07-17 17:22:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-17 17:22:34,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:34,133 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:34,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:22:34,134 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-07-17 17:22:34,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:34,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552253258] [2020-07-17 17:22:34,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-07-17 17:22:34,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552253258] [2020-07-17 17:22:34,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:34,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:22:34,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228568639] [2020-07-17 17:22:34,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:22:34,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:22:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:22:34,572 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-07-17 17:22:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:34,759 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-07-17 17:22:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:22:34,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-07-17 17:22:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:34,761 INFO L225 Difference]: With dead ends: 86 [2020-07-17 17:22:34,761 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 17:22:34,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:22:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 17:22:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-17 17:22:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-17 17:22:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-07-17 17:22:34,772 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-07-17 17:22:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:34,773 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-07-17 17:22:34,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:22:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-07-17 17:22:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-07-17 17:22:34,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:34,775 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:34,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:22:34,775 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-07-17 17:22:34,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:34,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834449218] [2020-07-17 17:22:34,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-07-17 17:22:35,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [834449218] [2020-07-17 17:22:35,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:35,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-17 17:22:35,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323887395] [2020-07-17 17:22:35,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 17:22:35,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:35,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 17:22:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:22:35,332 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-07-17 17:22:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:35,532 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-07-17 17:22:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 17:22:35,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-07-17 17:22:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:35,534 INFO L225 Difference]: With dead ends: 91 [2020-07-17 17:22:35,534 INFO L226 Difference]: Without dead ends: 85 [2020-07-17 17:22:35,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-07-17 17:22:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-17 17:22:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-17 17:22:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 17:22:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-07-17 17:22:35,545 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-07-17 17:22:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:35,546 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-07-17 17:22:35,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 17:22:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-07-17 17:22:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-07-17 17:22:35,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:35,547 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:35,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:22:35,548 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-07-17 17:22:35,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:35,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338143385] [2020-07-17 17:22:35,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-07-17 17:22:36,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338143385] [2020-07-17 17:22:36,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:36,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-17 17:22:36,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256156925] [2020-07-17 17:22:36,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 17:22:36,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 17:22:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:22:36,247 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-07-17 17:22:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:36,455 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-07-17 17:22:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:22:36,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-07-17 17:22:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:36,457 INFO L225 Difference]: With dead ends: 96 [2020-07-17 17:22:36,457 INFO L226 Difference]: Without dead ends: 90 [2020-07-17 17:22:36,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-07-17 17:22:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-17 17:22:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-17 17:22:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-17 17:22:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-07-17 17:22:36,467 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-07-17 17:22:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:36,468 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-07-17 17:22:36,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 17:22:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-07-17 17:22:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-07-17 17:22:36,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:36,470 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:36,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 17:22:36,470 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-07-17 17:22:36,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:36,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820172362] [2020-07-17 17:22:36,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-07-17 17:22:37,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820172362] [2020-07-17 17:22:37,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:37,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-07-17 17:22:37,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796571788] [2020-07-17 17:22:37,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 17:22:37,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:37,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 17:22:37,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-07-17 17:22:37,165 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-07-17 17:22:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:37,399 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-07-17 17:22:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:22:37,400 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-07-17 17:22:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:37,401 INFO L225 Difference]: With dead ends: 101 [2020-07-17 17:22:37,402 INFO L226 Difference]: Without dead ends: 95 [2020-07-17 17:22:37,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-07-17 17:22:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-17 17:22:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-07-17 17:22:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 17:22:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-07-17 17:22:37,413 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-07-17 17:22:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:37,414 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-07-17 17:22:37,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 17:22:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-07-17 17:22:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-07-17 17:22:37,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:22:37,417 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:22:37,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 17:22:37,417 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:22:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:22:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-07-17 17:22:37,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:22:37,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1651665244] [2020-07-17 17:22:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:22:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:22:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 539 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2020-07-17 17:22:39,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1651665244] [2020-07-17 17:22:39,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:22:39,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2020-07-17 17:22:39,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177525769] [2020-07-17 17:22:39,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-07-17 17:22:39,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:22:39,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-07-17 17:22:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2020-07-17 17:22:39,516 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 40 states. [2020-07-17 17:22:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:22:42,453 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2020-07-17 17:22:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-07-17 17:22:42,453 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 153 [2020-07-17 17:22:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:22:42,454 INFO L225 Difference]: With dead ends: 95 [2020-07-17 17:22:42,455 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:22:42,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1573, Invalid=6259, Unknown=0, NotChecked=0, Total=7832 [2020-07-17 17:22:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:22:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:22:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:22:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:22:42,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2020-07-17 17:22:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:22:42,462 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:22:42,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-07-17 17:22:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:22:42,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:22:42,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 17:22:42,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:22:43,297 WARN L193 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-17 17:22:43,996 WARN L193 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-07-17 17:22:44,540 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2020-07-17 17:22:44,994 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2020-07-17 17:22:45,395 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2020-07-17 17:22:45,429 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:22:45,429 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:22:45,430 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:22:45,430 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:22:45,430 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:22:45,430 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:22:45,431 INFO L264 CegarLoopResult]: At program point sumEXIT(lines 3 9) the Hoare annotation is: (let ((.cse3 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (= sum_~n |sum_#in~n|)) (.cse2 (<= |sum_#res| .cse3))) (or (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 .cse1 (<= .cse3 |sum_#res|) (<= |sum_#res| |sum_#in~m|)) (and (<= |sum_#in~n| 5) .cse0 (<= (+ |sum_#in~m| 5) |sum_#res|) .cse1 .cse2) (and (<= |sum_#in~n| 12) .cse0 .cse1 (<= (+ |sum_#in~m| 12) |sum_#res|) .cse2) (and .cse0 (<= |sum_#in~n| 13) .cse1 .cse2 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 14) (<= (+ |sum_#in~m| 14) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#res|)) (and (<= (+ |sum_#in~m| 9) |sum_#res|) .cse0 (<= |sum_#in~n| 9) .cse1 .cse2) (and (<= |sum_#in~n| 1) .cse0 .cse1 (<= (+ |sum_#in~m| 1) |sum_#res|) .cse2) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 4) (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 11) |sum_#res|) (<= |sum_#in~n| 11)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 .cse2 (<= |sum_#in~n| 6)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 10))))) [2020-07-17 17:22:45,431 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n)) [2020-07-17 17:22:45,431 INFO L264 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= |sum_#in~n| 14)) (and .cse0 (<= (+ |sum_#in~m| 15) |sum_#t~ret0|)))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse1 (<= |sum_#in~n| 13) (<= (+ |sum_#in~m| 13) |sum_#t~ret0|) .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#in~n| 1) .cse1 .cse2) (and .cse1 (<= |sum_#in~n| 2) (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) .cse2) (and (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 8) .cse2) (and .cse1 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|) (<= |sum_#in~n| 4) .cse2) (and .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse2) (and (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 14) |sum_#t~ret0|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 11) |sum_#t~ret0|) (<= |sum_#in~n| 11) .cse2) (and .cse1 (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) (<= |sum_#in~n| 7) .cse2) (and .cse1 (<= |sum_#in~n| 9) (<= (+ |sum_#in~m| 9) |sum_#t~ret0|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 6) |sum_#t~ret0|) (<= |sum_#in~n| 6) .cse2) (and (<= |sum_#in~n| 12) .cse1 (<= (+ |sum_#in~m| 12) |sum_#t~ret0|) .cse2) (and .cse1 (<= |sum_#in~n| 10) (<= (+ |sum_#in~m| 10) |sum_#t~ret0|) .cse2)))) [2020-07-17 17:22:45,432 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= |sum_#in~n| 0)) [2020-07-17 17:22:45,432 INFO L264 CegarLoopResult]: At program point L7-2(line 7) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= |sum_#in~n| 14)) (and .cse0 (<= (+ |sum_#in~m| 15) |sum_#t~ret0|)))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse1 (<= |sum_#in~n| 13) (<= (+ |sum_#in~m| 13) |sum_#t~ret0|) .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#in~n| 1) .cse1 .cse2) (and .cse1 (<= |sum_#in~n| 2) (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) .cse2) (and (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 8) .cse2) (and .cse1 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|) (<= |sum_#in~n| 4) .cse2) (and .cse1 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse2) (and (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 14) |sum_#t~ret0|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 11) |sum_#t~ret0|) (<= |sum_#in~n| 11) .cse2) (and .cse1 (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) (<= |sum_#in~n| 7) .cse2) (and .cse1 (<= |sum_#in~n| 9) (<= (+ |sum_#in~m| 9) |sum_#t~ret0|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 6) |sum_#t~ret0|) (<= |sum_#in~n| 6) .cse2) (and (<= |sum_#in~n| 12) .cse1 (<= (+ |sum_#in~m| 12) |sum_#t~ret0|) .cse2) (and .cse1 (<= |sum_#in~n| 10) (<= (+ |sum_#in~m| 10) |sum_#t~ret0|) .cse2)))) [2020-07-17 17:22:45,432 INFO L264 CegarLoopResult]: At program point L4(lines 4 8) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|)) [2020-07-17 17:22:45,433 INFO L264 CegarLoopResult]: At program point L7-3(line 7) the Hoare annotation is: (let ((.cse19 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (= sum_~n |sum_#in~n|)) (.cse3 (<= |sum_#res| .cse19)) (.cse4 (<= |sum_#t~ret0| .cse19))) (or (let ((.cse0 (+ |sum_#in~m| 1))) (and (<= .cse0 |sum_#t~ret0|) (<= |sum_#in~n| 1) .cse1 .cse2 (<= .cse0 |sum_#res|) .cse3 .cse4)) (let ((.cse5 (+ |sum_#in~m| 4))) (and .cse1 (<= .cse5 |sum_#t~ret0|) .cse2 .cse3 (<= |sum_#in~n| 4) (<= .cse5 |sum_#res|) .cse4)) (let ((.cse6 (+ |sum_#in~m| 2))) (and .cse1 (<= |sum_#in~n| 2) .cse2 (<= .cse6 |sum_#t~ret0|) .cse3 (<= .cse6 |sum_#res|) .cse4)) (let ((.cse7 (+ |sum_#in~m| 5))) (and (<= |sum_#in~n| 5) .cse1 (<= .cse7 |sum_#res|) .cse2 .cse3 (<= .cse7 |sum_#t~ret0|) .cse4)) (let ((.cse8 (+ |sum_#in~m| 6))) (and (<= .cse8 |sum_#res|) .cse1 (<= .cse8 |sum_#t~ret0|) .cse2 .cse3 (<= |sum_#in~n| 6) .cse4)) (let ((.cse9 (+ |sum_#in~m| 3))) (and .cse1 .cse2 .cse3 (<= |sum_#in~n| 3) (<= .cse9 |sum_#res|) (<= .cse9 |sum_#t~ret0|) .cse4)) (let ((.cse10 (+ |sum_#in~m| 9))) (and (<= .cse10 |sum_#res|) .cse1 (<= |sum_#in~n| 9) .cse2 .cse3 (<= .cse10 |sum_#t~ret0|) .cse4)) (let ((.cse11 (+ |sum_#in~m| 12))) (and (<= |sum_#in~n| 12) .cse1 .cse2 (<= .cse11 |sum_#res|) .cse3 (<= .cse11 |sum_#t~ret0|) .cse4)) (let ((.cse12 (+ |sum_#in~m| 8))) (and (<= .cse12 |sum_#t~ret0|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 8) (<= .cse12 |sum_#res|) .cse4)) (let ((.cse13 (+ |sum_#in~m| 15))) (and .cse1 .cse2 .cse3 (<= .cse13 |sum_#res|) .cse4 (<= .cse13 |sum_#t~ret0|))) (let ((.cse14 (+ |sum_#in~m| 11))) (and .cse1 (<= .cse14 |sum_#t~ret0|) .cse2 .cse3 (<= .cse14 |sum_#res|) (<= |sum_#in~n| 11) .cse4)) (let ((.cse15 (+ |sum_#in~m| 7))) (and .cse1 .cse2 .cse3 (<= .cse15 |sum_#t~ret0|) (<= .cse15 |sum_#res|) (<= |sum_#in~n| 7) .cse4)) (let ((.cse16 (+ |sum_#in~m| 14))) (and .cse1 .cse2 .cse3 (<= |sum_#in~n| 14) (<= .cse16 |sum_#res|) (<= .cse16 |sum_#t~ret0|) .cse4)) (let ((.cse17 (+ |sum_#in~m| 10))) (and .cse1 (<= .cse17 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 10) (<= .cse17 |sum_#t~ret0|) .cse4)) (let ((.cse18 (+ |sum_#in~m| 13))) (and .cse1 (<= |sum_#in~n| 13) .cse2 .cse3 (<= .cse18 |sum_#res|) (<= .cse18 |sum_#t~ret0|) .cse4))))) [2020-07-17 17:22:45,433 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-07-17 17:22:45,433 INFO L264 CegarLoopResult]: At program point sumFINAL(lines 3 9) the Hoare annotation is: (let ((.cse3 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (= sum_~n |sum_#in~n|)) (.cse2 (<= |sum_#res| .cse3))) (or (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 .cse1 (<= .cse3 |sum_#res|) (<= |sum_#res| |sum_#in~m|)) (and (<= |sum_#in~n| 5) .cse0 (<= (+ |sum_#in~m| 5) |sum_#res|) .cse1 .cse2) (and (<= |sum_#in~n| 12) .cse0 .cse1 (<= (+ |sum_#in~m| 12) |sum_#res|) .cse2) (and .cse0 (<= |sum_#in~n| 13) .cse1 .cse2 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 14) (<= (+ |sum_#in~m| 14) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#res|)) (and (<= (+ |sum_#in~m| 9) |sum_#res|) .cse0 (<= |sum_#in~n| 9) .cse1 .cse2) (and (<= |sum_#in~n| 1) .cse0 .cse1 (<= (+ |sum_#in~m| 1) |sum_#res|) .cse2) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 4) (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 11) |sum_#res|) (<= |sum_#in~n| 11)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 .cse2 (<= |sum_#in~n| 6)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 10))))) [2020-07-17 17:22:45,434 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-07-17 17:22:45,434 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-07-17 17:22:45,434 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-17 17:22:45,434 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 15 main_~a~0) [2020-07-17 17:22:45,434 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-07-17 17:22:45,435 INFO L264 CegarLoopResult]: At program point L15(lines 15 17) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= main_~result~0 .cse0) (<= .cse0 main_~result~0) (<= 15 main_~a~0) (<= main_~a~0 15))) [2020-07-17 17:22:45,435 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= 15 main_~a~0) (<= main_~a~0 15)) [2020-07-17 17:22:45,435 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 15 main_~a~0) (<= main_~a~0 15)) [2020-07-17 17:22:45,435 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 |main_#t~ret1|) (<= 15 main_~a~0) (<= main_~a~0 15) (<= |main_#t~ret1| .cse0))) [2020-07-17 17:22:45,435 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 15 main_~a~0) [2020-07-17 17:22:45,435 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 |main_#t~ret1|) (<= 15 main_~a~0) (<= main_~a~0 15) (<= |main_#t~ret1| .cse0))) [2020-07-17 17:22:45,436 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 |main_#t~ret1|) (<= main_~result~0 .cse0) (<= .cse0 main_~result~0) (<= 15 main_~a~0) (<= main_~a~0 15) (<= |main_#t~ret1| .cse0))) [2020-07-17 17:22:45,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:22:45 BoogieIcfgContainer [2020-07-17 17:22:45,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:22:45,468 INFO L168 Benchmark]: Toolchain (without parser) took 16631.27 ms. Allocated memory was 137.4 MB in the beginning and 492.8 MB in the end (delta: 355.5 MB). Free memory was 102.9 MB in the beginning and 375.7 MB in the end (delta: -272.7 MB). Peak memory consumption was 371.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:45,469 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 17:22:45,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.92 ms. Allocated memory is still 137.4 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:45,471 INFO L168 Benchmark]: Boogie Preprocessor took 30.02 ms. Allocated memory is still 137.4 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:45,472 INFO L168 Benchmark]: RCFGBuilder took 349.42 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.6 MB in the beginning and 170.7 MB in the end (delta: -79.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:45,473 INFO L168 Benchmark]: TraceAbstraction took 15998.12 ms. Allocated memory was 202.4 MB in the beginning and 492.8 MB in the end (delta: 290.5 MB). Free memory was 170.0 MB in the beginning and 375.7 MB in the end (delta: -205.7 MB). Peak memory consumption was 373.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:22:45,476 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.92 ms. Allocated memory is still 137.4 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.02 ms. Allocated memory is still 137.4 MB. Free memory was 92.9 MB in the beginning and 91.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 349.42 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.6 MB in the beginning and 170.7 MB in the end (delta: -79.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15998.12 ms. Allocated memory was 202.4 MB in the beginning and 492.8 MB in the end (delta: 290.5 MB). Free memory was 170.0 MB in the beginning and 375.7 MB in the end (delta: -205.7 MB). Peak memory consumption was 373.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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 - ProcedureContractResult [Line: 3]: Procedure Contract for sum Derived contract for procedure sum: ((((((((((((((((((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(n) <= 8) && \old(m) + 8 <= \result) || (((m == \old(m) && n == \old(n)) && \old(n) + \old(m) <= \result) && \result <= \old(m))) || ((((\old(n) <= 5 && m == \old(m)) && \old(m) + 5 <= \result) && n == \old(n)) && \result <= \old(n) + \old(m))) || ((((\old(n) <= 12 && m == \old(m)) && n == \old(n)) && \old(m) + 12 <= \result) && \result <= \old(n) + \old(m))) || ((((m == \old(m) && \old(n) <= 13) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(m) + 13 <= \result)) || ((((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(n) <= 3) && \old(m) + 3 <= \result)) || ((((m == \old(m) && \old(n) <= 2) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(m) + 2 <= \result)) || ((((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(n) <= 14) && \old(m) + 14 <= \result)) || (((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(m) + 15 <= \result)) || ((((\old(m) + 9 <= \result && m == \old(m)) && \old(n) <= 9) && n == \old(n)) && \result <= \old(n) + \old(m))) || ((((\old(n) <= 1 && m == \old(m)) && n == \old(n)) && \old(m) + 1 <= \result) && \result <= \old(n) + \old(m))) || ((((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(n) <= 4) && \old(m) + 4 <= \result)) || ((((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(m) + 7 <= \result) && \old(n) <= 7)) || ((((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(m) + 11 <= \result) && \old(n) <= 11)) || ((((\old(m) + 6 <= \result && m == \old(m)) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || ((((m == \old(m) && \old(m) + 10 <= \result) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(n) <= 10) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 15 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.9s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 315 SDtfs, 673 SDslu, 1616 SDs, 0 SdLazy, 1380 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 692 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 37 PreInvPairs, 262 NumberOfFragments, 1720 HoareAnnotationTreeSize, 37 FomulaSimplifications, 1590 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 27 FomulaSimplificationsInter, 706 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1352 ConstructedInterpolants, 0 QuantifiedInterpolants, 491384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 3125/5640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...