/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:29:16,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:29:16,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:29:16,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:29:16,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:29:16,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:29:16,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:29:16,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:29:16,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:29:16,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:29:16,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:29:16,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:29:16,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:29:16,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:29:16,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:29:16,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:29:16,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:29:16,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:29:16,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:29:16,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:29:16,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:29:16,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:29:16,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:29:16,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:29:16,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:29:16,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:29:16,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:29:16,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:29:16,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:29:16,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:29:16,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:29:16,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:29:16,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:29:16,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:29:16,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:29:16,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:29:16,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:29:16,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:29:16,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:29:16,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:29:16,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:29:16,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:29:16,357 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:29:16,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:29:16,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:29:16,362 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:29:16,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:29:16,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:29:16,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:29:16,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:29:16,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:29:16,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:29:16,364 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:29:16,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:29:16,365 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:29:16,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:29:16,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:29:16,366 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:29:16,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:29:16,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:29:16,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:29:16,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:29:16,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:29:16,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:29:16,368 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:29:16,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:29:16,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:29:16,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:29:16,901 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:29:16,902 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:29:16,903 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c [2020-09-04 16:29:17,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5535b9e34/f9339d1c7c774118982718df013ff947/FLAG8a9a89f6d [2020-09-04 16:29:17,642 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:29:17,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i15_o15-1.c [2020-09-04 16:29:17,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5535b9e34/f9339d1c7c774118982718df013ff947/FLAG8a9a89f6d [2020-09-04 16:29:17,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5535b9e34/f9339d1c7c774118982718df013ff947 [2020-09-04 16:29:17,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:29:17,993 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:29:17,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:17,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:29:18,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:29:18,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:17" (1/1) ... [2020-09-04 16:29:18,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76dcc237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18, skipping insertion in model container [2020-09-04 16:29:18,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:17" (1/1) ... [2020-09-04 16:29:18,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:29:18,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:29:18,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:18,307 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:29:18,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:18,348 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:29:18,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18 WrapperNode [2020-09-04 16:29:18,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:18,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:29:18,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:29:18,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:29:18,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... [2020-09-04 16:29:18,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... [2020-09-04 16:29:18,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... [2020-09-04 16:29:18,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... [2020-09-04 16:29:18,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... [2020-09-04 16:29:18,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... [2020-09-04 16:29:18,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... [2020-09-04 16:29:18,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:29:18,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:29:18,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:29:18,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:29:18,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 16:29:18,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:29:18,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:29:18,592 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:29:18,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:29:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:29:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:29:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:29:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:29:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:29:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:29:18,831 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:29:18,831 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:29:18,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:18 BoogieIcfgContainer [2020-09-04 16:29:18,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:29:18,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:29:18,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:29:18,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:29:18,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:29:17" (1/3) ... [2020-09-04 16:29:18,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca20107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:18, skipping insertion in model container [2020-09-04 16:29:18,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:18" (2/3) ... [2020-09-04 16:29:18,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca20107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:18, skipping insertion in model container [2020-09-04 16:29:18,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:18" (3/3) ... [2020-09-04 16:29:18,852 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-1.c [2020-09-04 16:29:18,869 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:29:18,884 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:29:18,913 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:29:18,964 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:29:18,964 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:29:18,964 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:29:18,964 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:29:18,965 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:29:18,965 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:29:18,965 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:29:18,965 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:29:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 16:29:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:29:19,015 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:19,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:19,018 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:19,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 16:29:19,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:19,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704152762] [2020-09-04 16:29:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:19,165 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:29:19,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704152762] [2020-09-04 16:29:19,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:19,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:29:19,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481303548] [2020-09-04 16:29:19,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:29:19,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:19,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:29:19,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:29:19,410 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 16:29:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:19,532 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 16:29:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:29:19,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:29:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:19,551 INFO L225 Difference]: With dead ends: 37 [2020-09-04 16:29:19,551 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 16:29:19,557 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-09-04 16:29:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 16:29:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 16:29:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 16:29:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 16:29:19,629 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 16:29:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:19,630 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 16:29:19,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:29:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 16:29:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:29:19,634 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:19,635 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:19,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:29:19,636 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:19,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 16:29:19,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:19,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [810510192] [2020-09-04 16:29:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:19,641 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:29:19,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [810510192] [2020-09-04 16:29:19,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:19,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:29:19,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557806987] [2020-09-04 16:29:19,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:29:19,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:29:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:29:19,809 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 16:29:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:19,900 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 16:29:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:29:19,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 16:29:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:19,903 INFO L225 Difference]: With dead ends: 34 [2020-09-04 16:29:19,904 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:29:19,906 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-09-04 16:29:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:29:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:29:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:29:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 16:29:19,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 16:29:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:19,924 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 16:29:19,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:29:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 16:29:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 16:29:19,926 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:19,926 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:19,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:29:19,927 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 16:29:19,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:19,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255108383] [2020-09-04 16:29:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:19,932 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:19,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:29:20,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255108383] [2020-09-04 16:29:20,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:20,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:29:20,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129946656] [2020-09-04 16:29:20,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:29:20,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:29:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:29:20,137 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 16:29:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:20,229 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 16:29:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:29:20,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 16:29:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:20,232 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:29:20,233 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:29:20,234 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-09-04 16:29:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:29:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 16:29:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 16:29:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 16:29:20,247 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 16:29:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:20,248 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 16:29:20,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:29:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 16:29:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 16:29:20,251 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:20,251 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:20,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:29:20,251 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 16:29:20,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:20,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615957165] [2020-09-04 16:29:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:20,256 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 16:29:20,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615957165] [2020-09-04 16:29:20,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:20,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:29:20,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700472683] [2020-09-04 16:29:20,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:29:20,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:29:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:29:20,560 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 16:29:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:20,666 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 16:29:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:29:20,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 16:29:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:20,669 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:29:20,669 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 16:29:20,670 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-09-04 16:29:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 16:29:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 16:29:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 16:29:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 16:29:20,683 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 16:29:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:20,684 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 16:29:20,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:29:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 16:29:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:29:20,686 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:20,686 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:20,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:29:20,687 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 16:29:20,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:20,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1356686580] [2020-09-04 16:29:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:20,691 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:20,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 16:29:21,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1356686580] [2020-09-04 16:29:21,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:21,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:29:21,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235590074] [2020-09-04 16:29:21,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:29:21,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:21,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:29:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:29:21,032 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 16:29:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:21,119 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 16:29:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:29:21,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 16:29:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:21,121 INFO L225 Difference]: With dead ends: 49 [2020-09-04 16:29:21,122 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:29:21,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:29:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:29:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:29:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 16:29:21,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 16:29:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:21,134 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 16:29:21,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:29:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 16:29:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:29:21,137 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:21,137 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:21,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:29:21,137 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 16:29:21,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:21,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1439831565] [2020-09-04 16:29:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:21,141 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 16:29:21,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1439831565] [2020-09-04 16:29:21,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:21,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:29:21,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861989768] [2020-09-04 16:29:21,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:29:21,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:29:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:29:21,385 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 16:29:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:21,500 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 16:29:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:29:21,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 16:29:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:21,503 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:29:21,504 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 16:29:21,505 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-09-04 16:29:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 16:29:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 16:29:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 16:29:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 16:29:21,517 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 16:29:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:21,518 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 16:29:21,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:29:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 16:29:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:29:21,520 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:21,520 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:21,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:29:21,521 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 16:29:21,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:21,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652166625] [2020-09-04 16:29:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:21,524 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 16:29:21,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652166625] [2020-09-04 16:29:21,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:21,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:29:21,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009882685] [2020-09-04 16:29:21,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:29:21,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:29:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:29:21,810 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 16:29:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:21,934 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 16:29:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:29:21,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 16:29:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:21,937 INFO L225 Difference]: With dead ends: 59 [2020-09-04 16:29:21,937 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 16:29:21,938 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-09-04 16:29:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 16:29:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 16:29:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 16:29:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 16:29:21,949 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 16:29:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:21,950 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 16:29:21,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:29:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 16:29:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:29:21,952 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:21,952 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:21,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:29:21,953 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 16:29:21,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:21,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1453706456] [2020-09-04 16:29:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:21,956 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:21,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 16:29:22,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1453706456] [2020-09-04 16:29:22,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:22,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:29:22,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484196921] [2020-09-04 16:29:22,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:29:22,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:29:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:22,262 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 16:29:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:22,409 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 16:29:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:29:22,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 16:29:22,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:22,411 INFO L225 Difference]: With dead ends: 64 [2020-09-04 16:29:22,411 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 16:29:22,412 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-09-04 16:29:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 16:29:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 16:29:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 16:29:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 16:29:22,424 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 16:29:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:22,424 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 16:29:22,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:29:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 16:29:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 16:29:22,426 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:22,427 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:22,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:29:22,427 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 16:29:22,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:22,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070292342] [2020-09-04 16:29:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:22,431 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 16:29:22,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070292342] [2020-09-04 16:29:22,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:22,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:29:22,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22168777] [2020-09-04 16:29:22,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:29:22,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:29:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:29:22,767 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 16:29:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:22,909 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 16:29:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:29:22,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 16:29:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:22,912 INFO L225 Difference]: With dead ends: 69 [2020-09-04 16:29:22,912 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 16:29:22,913 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-09-04 16:29:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 16:29:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 16:29:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 16:29:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 16:29:22,923 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 16:29:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:22,924 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 16:29:22,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:29:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 16:29:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 16:29:22,925 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:22,926 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:22,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:29:22,926 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:22,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 16:29:22,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:22,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [215254577] [2020-09-04 16:29:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:22,929 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 16:29:23,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [215254577] [2020-09-04 16:29:23,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:23,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:29:23,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604879770] [2020-09-04 16:29:23,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:29:23,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:23,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:29:23,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:23,339 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 16:29:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:23,510 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 16:29:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:29:23,511 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 16:29:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:23,512 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:29:23,512 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:29:23,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:29:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:29:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 16:29:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 16:29:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 16:29:23,524 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 16:29:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:23,524 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 16:29:23,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:29:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 16:29:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 16:29:23,526 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:23,526 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:23,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:29:23,527 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 16:29:23,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:23,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371682505] [2020-09-04 16:29:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:23,530 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 16:29:24,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371682505] [2020-09-04 16:29:24,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:24,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:29:24,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448658967] [2020-09-04 16:29:24,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:29:24,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:29:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:29:24,009 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 16:29:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:24,177 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 16:29:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:29:24,178 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 16:29:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:24,180 INFO L225 Difference]: With dead ends: 79 [2020-09-04 16:29:24,180 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:29:24,181 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-09-04 16:29:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:29:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 16:29:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 16:29:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 16:29:24,192 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 16:29:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:24,192 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 16:29:24,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:29:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 16:29:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 16:29:24,194 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:24,194 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:24,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:29:24,195 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:24,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 16:29:24,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:24,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1029591998] [2020-09-04 16:29:24,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:24,198 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 16:29:24,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1029591998] [2020-09-04 16:29:24,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:24,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:29:24,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244824365] [2020-09-04 16:29:24,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:29:24,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:29:24,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:29:24,770 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 16:29:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:24,975 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 16:29:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:29:24,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 16:29:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:24,977 INFO L225 Difference]: With dead ends: 84 [2020-09-04 16:29:24,978 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:29:24,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:29:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:29:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 16:29:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 16:29:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 16:29:24,989 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 16:29:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:24,989 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 16:29:24,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:29:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 16:29:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 16:29:24,991 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:24,991 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:24,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:29:24,992 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 16:29:24,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:24,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [498148745] [2020-09-04 16:29:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:24,996 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 16:29:25,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [498148745] [2020-09-04 16:29:25,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:25,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:29:25,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720131858] [2020-09-04 16:29:25,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:29:25,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:29:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:29:25,651 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 16:29:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:25,907 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 16:29:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:29:25,909 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 16:29:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:25,911 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:29:25,911 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 16:29:25,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:29:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 16:29:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 16:29:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 16:29:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 16:29:25,935 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 16:29:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:25,935 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 16:29:25,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:29:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 16:29:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 16:29:25,941 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:25,941 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:25,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:29:25,942 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 16:29:25,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:25,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457874292] [2020-09-04 16:29:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:25,954 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 16:29:26,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457874292] [2020-09-04 16:29:26,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:26,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:29:26,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810795160] [2020-09-04 16:29:26,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:29:26,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:29:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:29:26,772 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 16:29:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:26,993 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 16:29:26,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:29:26,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 16:29:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:26,995 INFO L225 Difference]: With dead ends: 94 [2020-09-04 16:29:26,995 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 16:29:26,996 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-09-04 16:29:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 16:29:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 16:29:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 16:29:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 16:29:27,006 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 16:29:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:27,006 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 16:29:27,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:29:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 16:29:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:29:27,008 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:27,008 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:27,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:29:27,009 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 16:29:27,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:27,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195543998] [2020-09-04 16:29:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:27,012 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 16:29:27,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195543998] [2020-09-04 16:29:27,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:27,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:29:27,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437295253] [2020-09-04 16:29:27,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:29:27,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:27,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:29:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:29:27,788 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 16:29:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:28,118 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 16:29:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:29:28,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 16:29:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:28,121 INFO L225 Difference]: With dead ends: 99 [2020-09-04 16:29:28,121 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 16:29:28,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:29:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 16:29:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 16:29:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 16:29:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 16:29:28,141 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 16:29:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:28,142 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 16:29:28,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:29:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 16:29:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 16:29:28,144 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:28,144 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:28,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:29:28,145 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 16:29:28,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:28,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1664033362] [2020-09-04 16:29:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:28,148 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-04 16:29:29,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1664033362] [2020-09-04 16:29:29,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:29,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2020-09-04 16:29:29,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135066291] [2020-09-04 16:29:29,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-09-04 16:29:29,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-09-04 16:29:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 16:29:29,915 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 35 states. [2020-09-04 16:29:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:31,576 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-09-04 16:29:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-04 16:29:31,577 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2020-09-04 16:29:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:31,579 INFO L225 Difference]: With dead ends: 104 [2020-09-04 16:29:31,579 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 16:29:31,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=2419, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 16:29:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 16:29:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 16:29:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 16:29:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 16:29:31,593 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 136 [2020-09-04 16:29:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:31,594 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 16:29:31,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-09-04 16:29:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 16:29:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:29:31,596 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:31,596 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:31,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:29:31,596 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2106505265, now seen corresponding path program 16 times [2020-09-04 16:29:31,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:31,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28186407] [2020-09-04 16:29:31,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:31,599 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-04 16:29:32,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28186407] [2020-09-04 16:29:32,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:32,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:29:32,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113793435] [2020-09-04 16:29:32,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:29:32,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:32,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:29:32,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:29:32,603 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2020-09-04 16:29:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:33,794 INFO L93 Difference]: Finished difference Result 216 states and 472 transitions. [2020-09-04 16:29:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-04 16:29:33,794 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 144 [2020-09-04 16:29:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:33,795 INFO L225 Difference]: With dead ends: 216 [2020-09-04 16:29:33,795 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:29:33,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=467, Invalid=939, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 16:29:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:29:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:29:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:29:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:29:33,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2020-09-04 16:29:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:33,808 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:29:33,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:29:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:29:33,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:29:33,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:29:33,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:29:37,118 WARN L193 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 130 [2020-09-04 16:29:37,677 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2020-09-04 16:29:38,428 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2020-09-04 16:29:39,243 WARN L193 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2020-09-04 16:29:39,962 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2020-09-04 16:29:39,969 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:29:39,970 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:29:39,970 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:29:39,970 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:29:39,970 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:29:39,970 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:29:39,971 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: false [2020-09-04 16:29:39,971 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-09-04 16:29:39,971 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 9 15) the Hoare annotation is: (<= 15 main_~input~0) [2020-09-04 16:29:39,972 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: false [2020-09-04 16:29:39,972 INFO L264 CegarLoopResult]: At program point L12(lines 12 14) the Hoare annotation is: (and (<= 15 main_~input~0) (<= 15 main_~result~0) (<= main_~result~0 15)) [2020-09-04 16:29:39,972 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= main_~input~0 15) (<= 15 main_~input~0)) [2020-09-04 16:29:39,972 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (and (<= 15 |main_#t~ret1|) (<= 15 main_~input~0) (<= |main_#t~ret1| 15)) [2020-09-04 16:29:39,973 INFO L264 CegarLoopResult]: At program point L12-2(lines 9 15) the Hoare annotation is: (<= 15 main_~input~0) [2020-09-04 16:29:39,973 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (and (<= 15 |main_#t~ret1|) (<= 15 main_~input~0) (<= |main_#t~ret1| 15)) [2020-09-04 16:29:39,973 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (<= 15 |main_#t~ret1|) (<= 15 main_~input~0) (<= 15 main_~result~0) (<= main_~result~0 15) (<= |main_#t~ret1| 15)) [2020-09-04 16:29:39,974 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= 16 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#res| 15)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)))) [2020-09-04 16:29:39,975 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 7) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= 16 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#res| 15)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)))) [2020-09-04 16:29:39,975 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-09-04 16:29:39,975 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:29:39,975 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-09-04 16:29:39,976 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x)) (.cse12 (<= 6 |id_#in~x|))) (let ((.cse8 (and (<= |id_#t~ret0| 5) .cse0 .cse12 (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|))) (.cse1 (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|))) (.cse2 (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11))) (.cse3 (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8))) (.cse4 (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8))) (.cse5 (and (<= 13 |id_#t~ret0|) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= |id_#in~x| 14))) (.cse6 (and .cse0 (<= 16 |id_#in~x|))) (.cse9 (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|))) (.cse10 (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7))) (.cse7 (and (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|))) (.cse11 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)))) (and (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) .cse1 .cse2 .cse3 (and (<= 5 |id_#in~x|) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) .cse4 .cse5 .cse6 .cse7 (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)) .cse8 (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) .cse9 .cse10 .cse11) (or .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse7 .cse11 (not .cse12))))) [2020-09-04 16:29:39,976 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-09-04 16:29:39,977 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x)) (.cse12 (<= 6 |id_#in~x|))) (let ((.cse8 (and (<= |id_#t~ret0| 5) .cse0 .cse12 (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|))) (.cse1 (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|))) (.cse2 (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse0 (<= |id_#in~x| 12) (<= |id_#t~ret0| 11))) (.cse3 (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8))) (.cse4 (and (<= 7 |id_#t~ret0|) (<= |id_#t~ret0| 7) .cse0 (<= 8 |id_#in~x|) (<= |id_#in~x| 8))) (.cse5 (and (<= 13 |id_#t~ret0|) (<= 14 |id_#in~x|) .cse0 (<= |id_#t~ret0| 13) (<= |id_#in~x| 14))) (.cse6 (and .cse0 (<= 16 |id_#in~x|))) (.cse9 (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|))) (.cse10 (and .cse0 (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7))) (.cse7 (and (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse0 (<= 14 |id_#t~ret0|))) (.cse11 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse0 (<= 12 |id_#t~ret0|)))) (and (or (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret0| 0) (<= |id_#in~x| 1)) .cse1 .cse2 .cse3 (and (<= 5 |id_#in~x|) .cse0 (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) .cse4 .cse5 .cse6 .cse7 (and .cse0 (<= 1 |id_#t~ret0|) (<= 2 |id_#in~x|) (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)) .cse8 (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse0 (<= |id_#in~x| 3) (<= 2 |id_#t~ret0|)) .cse9 .cse10 .cse11) (or .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse7 .cse11 (not .cse12))))) [2020-09-04 16:29:39,977 INFO L264 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: (let ((.cse16 (<= 2 |id_#in~x|)) (.cse7 (= |id_#in~x| id_~x))) (let ((.cse0 (and (<= 13 |id_#t~ret0|) (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse7 (<= |id_#t~ret0| 13) (<= 14 |id_#res|) (<= |id_#in~x| 14))) (.cse1 (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse7 (<= |id_#res| 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4))) (.cse2 (and (<= |id_#t~ret0| 9) (<= 9 |id_#t~ret0|) .cse7 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10))) (.cse3 (and .cse7 (<= 16 |id_#in~x|))) (.cse4 (and (<= |id_#res| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret0| 2) .cse7 (<= |id_#in~x| 3) (<= 3 |id_#res|) (<= 2 |id_#t~ret0|))) (.cse5 (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse7 (<= |id_#in~x| 4) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3) (<= 4 |id_#in~x|))) (.cse6 (and (<= |id_#t~ret0| 5) (<= |id_#res| 6) .cse7 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6) (<= 5 |id_#t~ret0|))) (.cse8 (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret0| 12) .cse7 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret0|))) (.cse9 (and (<= 7 |id_#res|) .cse7 (<= |id_#res| 7) (<= |id_#t~ret0| 6) (<= 7 |id_#in~x|) (<= 6 |id_#t~ret0|) (<= |id_#in~x| 7))) (.cse10 (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse7 (<= |id_#res| 11) (<= 11 |id_#res|) (<= |id_#t~ret0| 10) (<= 10 |id_#t~ret0|))) (.cse11 (and (<= 7 |id_#t~ret0|) (<= |id_#res| 8) (<= |id_#t~ret0| 7) .cse7 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8))) (.cse12 (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret0| 14) .cse7 (<= 14 |id_#t~ret0|) (<= |id_#res| 15))) (.cse13 (and (<= 12 |id_#in~x|) (<= 11 |id_#t~ret0|) .cse7 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret0| 11))) (.cse14 (and (<= 9 |id_#res|) .cse7 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret0|) (<= 9 |id_#in~x|) (<= |id_#t~ret0| 8))) (.cse15 (and (<= 2 |id_#res|) .cse7 (<= 1 |id_#t~ret0|) (<= |id_#res| 2) .cse16 (<= |id_#t~ret0| 1) (<= |id_#in~x| 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (<= 1 |id_#in~x|) .cse7 (<= |id_#res| 1) (= |id_#t~ret0| 0) (<= 1 |id_#res|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse16) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2020-09-04 16:29:40,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:29:40 BoogieIcfgContainer [2020-09-04 16:29:40,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:29:40,032 INFO L168 Benchmark]: Toolchain (without parser) took 22039.73 ms. Allocated memory was 139.5 MB in the beginning and 448.8 MB in the end (delta: 309.3 MB). Free memory was 104.0 MB in the beginning and 158.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 322.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:40,033 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-04 16:29:40,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.07 ms. Allocated memory is still 139.5 MB. Free memory was 103.6 MB in the beginning and 94.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:40,034 INFO L168 Benchmark]: Boogie Preprocessor took 34.89 ms. Allocated memory is still 139.5 MB. Free memory was 94.6 MB in the beginning and 93.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:40,035 INFO L168 Benchmark]: RCFGBuilder took 453.44 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.0 MB in the beginning and 169.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:40,036 INFO L168 Benchmark]: TraceAbstraction took 21187.90 ms. Allocated memory was 202.4 MB in the beginning and 448.8 MB in the end (delta: 246.4 MB). Free memory was 168.8 MB in the beginning and 158.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:40,040 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.31 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.07 ms. Allocated memory is still 139.5 MB. Free memory was 103.6 MB in the beginning and 94.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.89 ms. Allocated memory is still 139.5 MB. Free memory was 94.6 MB in the beginning and 93.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 453.44 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.0 MB in the beginning and 169.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21187.90 ms. Allocated memory was 202.4 MB in the beginning and 448.8 MB in the end (delta: 246.4 MB). Free memory was 168.8 MB in the beginning and 158.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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: 9]: Procedure Contract for main Derived contract for procedure main: 15 <= input - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: (((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || (\old(x) == x && 16 <= \old(x))) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || (((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \result <= 15)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((\old(x) == x && \result == 0) && \old(x) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.8s, OverallIterations: 17, TraceHistogramMax: 17, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 409 SDtfs, 737 SDslu, 3016 SDs, 0 SdLazy, 2856 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 713 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 169 PreInvPairs, 1153 NumberOfFragments, 2057 HoareAnnotationTreeSize, 169 FomulaSimplifications, 1076 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 25 FomulaSimplificationsInter, 11261 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...