/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/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:43:12,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:43:12,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:43:12,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:43:12,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:43:12,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:43:12,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:43:12,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:43:12,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:43:12,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:43:12,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:43:12,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:43:12,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:43:12,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:43:12,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:43:12,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:43:12,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:43:12,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:43:12,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:43:12,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:43:12,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:43:12,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:43:12,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:43:12,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:43:12,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:43:12,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:43:12,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:43:12,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:43:12,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:43:12,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:43:12,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:43:12,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:43:12,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:43:12,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:43:12,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:43:12,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:43:12,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:43:12,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:43:12,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:43:12,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:43:12,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:43:12,907 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 17:43:12,921 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:43:12,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:43:12,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:43:12,923 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:43:12,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:43:12,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:43:12,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:43:12,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:43:12,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:43:12,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:43:12,925 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:43:12,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:43:12,926 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:43:12,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:43:12,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:43:12,927 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:43:12,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:43:12,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:43:12,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:43:12,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:43:12,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:43:12,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:43:12,928 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:43:13,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:43:13,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:43:13,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:43:13,422 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:43:13,422 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:43:13,423 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-09-04 17:43:13,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7038abfd/bddcc769165a4a7ab526058dbe930954/FLAG5dae68c19 [2020-09-04 17:43:14,113 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:43:14,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-09-04 17:43:14,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7038abfd/bddcc769165a4a7ab526058dbe930954/FLAG5dae68c19 [2020-09-04 17:43:14,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e7038abfd/bddcc769165a4a7ab526058dbe930954 [2020-09-04 17:43:14,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:43:14,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:43:14,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:43:14,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:43:14,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:43:14,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526bcaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14, skipping insertion in model container [2020-09-04 17:43:14,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:43:14,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:43:14,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:43:14,720 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:43:14,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:43:14,862 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:43:14,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14 WrapperNode [2020-09-04 17:43:14,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:43:14,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:43:14,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:43:14,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:43:14,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (1/1) ... [2020-09-04 17:43:14,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:43:14,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:43:14,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:43:14,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:43:14,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (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 17:43:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:43:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:43:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:43:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2020-09-04 17:43:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2020-09-04 17:43:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:43:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:43:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:43:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 17:43:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2020-09-04 17:43:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 17:43:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2020-09-04 17:43:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 17:43:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:43:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 17:43:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 17:43:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:43:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:43:15,479 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:43:15,479 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-09-04 17:43:15,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:43:15 BoogieIcfgContainer [2020-09-04 17:43:15,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:43:15,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:43:15,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:43:15,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:43:15,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:43:14" (1/3) ... [2020-09-04 17:43:15,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fd729e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:43:15, skipping insertion in model container [2020-09-04 17:43:15,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:43:14" (2/3) ... [2020-09-04 17:43:15,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fd729e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:43:15, skipping insertion in model container [2020-09-04 17:43:15,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:43:15" (3/3) ... [2020-09-04 17:43:15,496 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2020-09-04 17:43:15,508 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:43:15,517 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:43:15,538 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:43:15,565 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:43:15,566 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:43:15,566 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:43:15,566 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:43:15,566 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:43:15,566 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:43:15,567 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:43:15,567 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:43:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2020-09-04 17:43:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 17:43:15,602 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:15,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:15,604 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1588916751, now seen corresponding path program 1 times [2020-09-04 17:43:15,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:15,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2142782884] [2020-09-04 17:43:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:15,701 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:15,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:15,862 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 17:43:15,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2142782884] [2020-09-04 17:43:15,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:15,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 17:43:15,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399037249] [2020-09-04 17:43:15,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 17:43:15,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 17:43:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:43:15,892 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2020-09-04 17:43:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:16,231 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2020-09-04 17:43:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 17:43:16,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 17:43:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:16,249 INFO L225 Difference]: With dead ends: 245 [2020-09-04 17:43:16,249 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 17:43:16,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:43:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 17:43:16,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-09-04 17:43:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 17:43:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2020-09-04 17:43:16,332 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 23 [2020-09-04 17:43:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:16,332 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2020-09-04 17:43:16,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 17:43:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-09-04 17:43:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 17:43:16,336 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:16,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:16,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:43:16,337 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:16,337 INFO L82 PathProgramCache]: Analyzing trace with hash -119454780, now seen corresponding path program 1 times [2020-09-04 17:43:16,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:16,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [710720985] [2020-09-04 17:43:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:16,341 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:16,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:16,432 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 17:43:16,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [710720985] [2020-09-04 17:43:16,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:16,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 17:43:16,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427185222] [2020-09-04 17:43:16,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 17:43:16,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 17:43:16,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:43:16,436 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2020-09-04 17:43:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:16,836 INFO L93 Difference]: Finished difference Result 303 states and 342 transitions. [2020-09-04 17:43:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 17:43:16,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-09-04 17:43:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:16,841 INFO L225 Difference]: With dead ends: 303 [2020-09-04 17:43:16,841 INFO L226 Difference]: Without dead ends: 199 [2020-09-04 17:43:16,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:43:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-09-04 17:43:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 124. [2020-09-04 17:43:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-09-04 17:43:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2020-09-04 17:43:16,868 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 23 [2020-09-04 17:43:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:16,869 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2020-09-04 17:43:16,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 17:43:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2020-09-04 17:43:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 17:43:16,870 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:16,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:16,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:43:16,871 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash -395870253, now seen corresponding path program 1 times [2020-09-04 17:43:16,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:16,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1376973490] [2020-09-04 17:43:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:16,904 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:16,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:17,008 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 17:43:17,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1376973490] [2020-09-04 17:43:17,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:17,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:43:17,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910138765] [2020-09-04 17:43:17,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:43:17,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:43:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:43:17,011 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 6 states. [2020-09-04 17:43:17,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:17,483 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2020-09-04 17:43:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:43:17,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-09-04 17:43:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:17,488 INFO L225 Difference]: With dead ends: 310 [2020-09-04 17:43:17,488 INFO L226 Difference]: Without dead ends: 206 [2020-09-04 17:43:17,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:43:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-04 17:43:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 131. [2020-09-04 17:43:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-09-04 17:43:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2020-09-04 17:43:17,528 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 30 [2020-09-04 17:43:17,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:17,532 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2020-09-04 17:43:17,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:43:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2020-09-04 17:43:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 17:43:17,534 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:17,535 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:17,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:43:17,535 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1926718692, now seen corresponding path program 2 times [2020-09-04 17:43:17,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:17,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503271275] [2020-09-04 17:43:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:17,545 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:17,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:17,680 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 17:43:17,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1503271275] [2020-09-04 17:43:17,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:17,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:43:17,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033474309] [2020-09-04 17:43:17,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:43:17,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:17,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:43:17,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:43:17,683 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 8 states. [2020-09-04 17:43:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:18,168 INFO L93 Difference]: Finished difference Result 317 states and 356 transitions. [2020-09-04 17:43:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:43:18,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-09-04 17:43:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:18,171 INFO L225 Difference]: With dead ends: 317 [2020-09-04 17:43:18,171 INFO L226 Difference]: Without dead ends: 213 [2020-09-04 17:43:18,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:43:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-09-04 17:43:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 138. [2020-09-04 17:43:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-09-04 17:43:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2020-09-04 17:43:18,211 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 37 [2020-09-04 17:43:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:18,212 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2020-09-04 17:43:18,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:43:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2020-09-04 17:43:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 17:43:18,214 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:18,214 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:18,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:43:18,216 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1889524403, now seen corresponding path program 3 times [2020-09-04 17:43:18,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:18,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1067464977] [2020-09-04 17:43:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:18,224 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:18,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:18,372 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 17:43:18,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1067464977] [2020-09-04 17:43:18,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:18,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:43:18,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45006457] [2020-09-04 17:43:18,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:43:18,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:43:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:43:18,375 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 5 states. [2020-09-04 17:43:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:18,681 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2020-09-04 17:43:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:43:18,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-09-04 17:43:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:18,684 INFO L225 Difference]: With dead ends: 248 [2020-09-04 17:43:18,684 INFO L226 Difference]: Without dead ends: 143 [2020-09-04 17:43:18,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:43:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-09-04 17:43:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2020-09-04 17:43:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-09-04 17:43:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2020-09-04 17:43:18,699 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 44 [2020-09-04 17:43:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:18,699 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2020-09-04 17:43:18,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:43:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2020-09-04 17:43:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 17:43:18,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:18,703 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:18,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:43:18,703 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1581132658, now seen corresponding path program 1 times [2020-09-04 17:43:18,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:18,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1143394745] [2020-09-04 17:43:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:18,714 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:18,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:18,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-09-04 17:43:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:18,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:43:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:18,906 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 17:43:18,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1143394745] [2020-09-04 17:43:18,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:18,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:43:18,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624990976] [2020-09-04 17:43:18,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:43:18,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:18,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:43:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:43:18,909 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 11 states. [2020-09-04 17:43:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:19,584 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2020-09-04 17:43:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:43:19,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2020-09-04 17:43:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:19,592 INFO L225 Difference]: With dead ends: 298 [2020-09-04 17:43:19,592 INFO L226 Difference]: Without dead ends: 195 [2020-09-04 17:43:19,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:43:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-09-04 17:43:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 144. [2020-09-04 17:43:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-09-04 17:43:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2020-09-04 17:43:19,621 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 80 [2020-09-04 17:43:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:19,622 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2020-09-04 17:43:19,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:43:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2020-09-04 17:43:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-09-04 17:43:19,630 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:19,630 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:19,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:43:19,631 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2142538913, now seen corresponding path program 2 times [2020-09-04 17:43:19,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:19,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032107020] [2020-09-04 17:43:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:19,643 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:19,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:19,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-04 17:43:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:19,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 17:43:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:19,898 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 17:43:19,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032107020] [2020-09-04 17:43:19,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:19,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 17:43:19,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744036736] [2020-09-04 17:43:19,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 17:43:19,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:19,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 17:43:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:43:19,904 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 13 states. [2020-09-04 17:43:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:20,493 INFO L93 Difference]: Finished difference Result 305 states and 338 transitions. [2020-09-04 17:43:20,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 17:43:20,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2020-09-04 17:43:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:20,498 INFO L225 Difference]: With dead ends: 305 [2020-09-04 17:43:20,498 INFO L226 Difference]: Without dead ends: 202 [2020-09-04 17:43:20,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2020-09-04 17:43:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-09-04 17:43:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 151. [2020-09-04 17:43:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-09-04 17:43:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2020-09-04 17:43:20,515 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 87 [2020-09-04 17:43:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:20,516 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2020-09-04 17:43:20,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 17:43:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2020-09-04 17:43:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-04 17:43:20,519 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:20,520 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:20,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:43:20,520 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1372997778, now seen corresponding path program 3 times [2020-09-04 17:43:20,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:20,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127517945] [2020-09-04 17:43:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:20,528 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:20,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:20,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 17:43:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:20,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 17:43:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:20,774 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 17:43:20,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [127517945] [2020-09-04 17:43:20,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:20,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 17:43:20,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109334764] [2020-09-04 17:43:20,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 17:43:20,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:20,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 17:43:20,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:43:20,779 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 15 states. [2020-09-04 17:43:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:21,563 INFO L93 Difference]: Finished difference Result 312 states and 345 transitions. [2020-09-04 17:43:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 17:43:21,564 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2020-09-04 17:43:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:21,566 INFO L225 Difference]: With dead ends: 312 [2020-09-04 17:43:21,566 INFO L226 Difference]: Without dead ends: 209 [2020-09-04 17:43:21,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2020-09-04 17:43:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-09-04 17:43:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2020-09-04 17:43:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-09-04 17:43:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2020-09-04 17:43:21,580 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 94 [2020-09-04 17:43:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:21,581 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2020-09-04 17:43:21,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 17:43:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2020-09-04 17:43:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-09-04 17:43:21,583 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:21,583 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:21,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 17:43:21,583 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1331129217, now seen corresponding path program 4 times [2020-09-04 17:43:21,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:21,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1789884848] [2020-09-04 17:43:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:21,589 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:21,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:21,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 17:43:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:21,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 17:43:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:21,825 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 17:43:21,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1789884848] [2020-09-04 17:43:21,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:21,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 17:43:21,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994259613] [2020-09-04 17:43:21,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 17:43:21,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 17:43:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-09-04 17:43:21,828 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 17 states. [2020-09-04 17:43:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:22,552 INFO L93 Difference]: Finished difference Result 319 states and 352 transitions. [2020-09-04 17:43:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 17:43:22,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2020-09-04 17:43:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:22,557 INFO L225 Difference]: With dead ends: 319 [2020-09-04 17:43:22,557 INFO L226 Difference]: Without dead ends: 216 [2020-09-04 17:43:22,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2020-09-04 17:43:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-09-04 17:43:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2020-09-04 17:43:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-09-04 17:43:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2020-09-04 17:43:22,574 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 101 [2020-09-04 17:43:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:22,576 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2020-09-04 17:43:22,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 17:43:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2020-09-04 17:43:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 17:43:22,578 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:22,578 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:22,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 17:43:22,580 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash -837086642, now seen corresponding path program 5 times [2020-09-04 17:43:22,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:22,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1090210985] [2020-09-04 17:43:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:22,588 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:22,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:22,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 17:43:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:22,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 17:43:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:22,677 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 17:43:22,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1090210985] [2020-09-04 17:43:22,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:22,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:43:22,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139012274] [2020-09-04 17:43:22,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:43:22,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:43:22,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:43:22,680 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand 5 states. [2020-09-04 17:43:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:22,955 INFO L93 Difference]: Finished difference Result 298 states and 327 transitions. [2020-09-04 17:43:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:43:22,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-04 17:43:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:22,958 INFO L225 Difference]: With dead ends: 298 [2020-09-04 17:43:22,958 INFO L226 Difference]: Without dead ends: 207 [2020-09-04 17:43:22,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 17:43:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-09-04 17:43:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 166. [2020-09-04 17:43:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-09-04 17:43:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2020-09-04 17:43:22,973 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 108 [2020-09-04 17:43:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:22,973 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2020-09-04 17:43:22,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:43:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2020-09-04 17:43:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-04 17:43:22,975 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:22,975 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:22,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 17:43:22,976 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash -118705538, now seen corresponding path program 1 times [2020-09-04 17:43:22,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:22,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [447218160] [2020-09-04 17:43:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:22,982 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 17:43:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 17:43:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,084 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 17:43:23,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [447218160] [2020-09-04 17:43:23,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:23,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:43:23,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089467801] [2020-09-04 17:43:23,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:43:23,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:23,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:43:23,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:43:23,087 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand 7 states. [2020-09-04 17:43:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:23,463 INFO L93 Difference]: Finished difference Result 305 states and 334 transitions. [2020-09-04 17:43:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:43:23,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2020-09-04 17:43:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:23,468 INFO L225 Difference]: With dead ends: 305 [2020-09-04 17:43:23,468 INFO L226 Difference]: Without dead ends: 214 [2020-09-04 17:43:23,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:43:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-09-04 17:43:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 173. [2020-09-04 17:43:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-09-04 17:43:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2020-09-04 17:43:23,489 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 115 [2020-09-04 17:43:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:23,490 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2020-09-04 17:43:23,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:43:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2020-09-04 17:43:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-09-04 17:43:23,491 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:23,492 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:23,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 17:43:23,492 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1732213838, now seen corresponding path program 2 times [2020-09-04 17:43:23,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:23,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667118926] [2020-09-04 17:43:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:23,498 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 17:43:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-04 17:43:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:23,766 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 17:43:23,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667118926] [2020-09-04 17:43:23,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:23,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 17:43:23,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699543407] [2020-09-04 17:43:23,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 17:43:23,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 17:43:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:43:23,769 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand 19 states. [2020-09-04 17:43:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:24,961 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2020-09-04 17:43:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 17:43:24,962 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 122 [2020-09-04 17:43:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:24,964 INFO L225 Difference]: With dead ends: 342 [2020-09-04 17:43:24,964 INFO L226 Difference]: Without dead ends: 231 [2020-09-04 17:43:24,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=853, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 17:43:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-09-04 17:43:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2020-09-04 17:43:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-09-04 17:43:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2020-09-04 17:43:24,982 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 122 [2020-09-04 17:43:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:24,982 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2020-09-04 17:43:24,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 17:43:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2020-09-04 17:43:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-09-04 17:43:24,985 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:24,985 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:24,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 17:43:24,986 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1756428833, now seen corresponding path program 3 times [2020-09-04 17:43:24,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:24,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705003763] [2020-09-04 17:43:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:24,993 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:25,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:25,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 17:43:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:25,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 17:43:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:25,287 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 17:43:25,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705003763] [2020-09-04 17:43:25,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:25,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 17:43:25,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726174995] [2020-09-04 17:43:25,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 17:43:25,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:25,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 17:43:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2020-09-04 17:43:25,291 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 21 states. [2020-09-04 17:43:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:26,452 INFO L93 Difference]: Finished difference Result 349 states and 382 transitions. [2020-09-04 17:43:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-09-04 17:43:26,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 129 [2020-09-04 17:43:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:26,454 INFO L225 Difference]: With dead ends: 349 [2020-09-04 17:43:26,454 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 17:43:26,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1059, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 17:43:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 17:43:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 187. [2020-09-04 17:43:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-09-04 17:43:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2020-09-04 17:43:26,479 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 129 [2020-09-04 17:43:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:26,479 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2020-09-04 17:43:26,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 17:43:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2020-09-04 17:43:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 17:43:26,481 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:26,482 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:26,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 17:43:26,482 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1609418542, now seen corresponding path program 4 times [2020-09-04 17:43:26,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:26,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [484946194] [2020-09-04 17:43:26,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:26,499 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:26,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:26,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 17:43:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:26,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2020-09-04 17:43:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:26,836 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 17:43:26,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [484946194] [2020-09-04 17:43:26,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:26,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 17:43:26,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302332680] [2020-09-04 17:43:26,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 17:43:26,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 17:43:26,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2020-09-04 17:43:26,843 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 23 states. [2020-09-04 17:43:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:28,028 INFO L93 Difference]: Finished difference Result 356 states and 389 transitions. [2020-09-04 17:43:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-09-04 17:43:28,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 136 [2020-09-04 17:43:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:28,032 INFO L225 Difference]: With dead ends: 356 [2020-09-04 17:43:28,032 INFO L226 Difference]: Without dead ends: 245 [2020-09-04 17:43:28,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2020-09-04 17:43:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-09-04 17:43:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 194. [2020-09-04 17:43:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-09-04 17:43:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2020-09-04 17:43:28,050 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 136 [2020-09-04 17:43:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:28,050 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2020-09-04 17:43:28,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 17:43:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2020-09-04 17:43:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-09-04 17:43:28,052 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:28,053 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:28,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 17:43:28,053 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash 450936575, now seen corresponding path program 5 times [2020-09-04 17:43:28,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:28,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236412058] [2020-09-04 17:43:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:28,060 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:28,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:28,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 17:43:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:28,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-09-04 17:43:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:28,495 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 17:43:28,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236412058] [2020-09-04 17:43:28,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:28,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 17:43:28,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70899059] [2020-09-04 17:43:28,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 17:43:28,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:28,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 17:43:28,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2020-09-04 17:43:28,498 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 25 states. [2020-09-04 17:43:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:29,806 INFO L93 Difference]: Finished difference Result 363 states and 396 transitions. [2020-09-04 17:43:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-09-04 17:43:29,806 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2020-09-04 17:43:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:29,808 INFO L225 Difference]: With dead ends: 363 [2020-09-04 17:43:29,809 INFO L226 Difference]: Without dead ends: 252 [2020-09-04 17:43:29,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=625, Invalid=1537, Unknown=0, NotChecked=0, Total=2162 [2020-09-04 17:43:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-09-04 17:43:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 201. [2020-09-04 17:43:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-09-04 17:43:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 213 transitions. [2020-09-04 17:43:29,825 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 213 transitions. Word has length 143 [2020-09-04 17:43:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:29,826 INFO L479 AbstractCegarLoop]: Abstraction has 201 states and 213 transitions. [2020-09-04 17:43:29,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 17:43:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 213 transitions. [2020-09-04 17:43:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-09-04 17:43:29,828 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:29,828 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:29,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 17:43:29,828 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:29,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1664120306, now seen corresponding path program 6 times [2020-09-04 17:43:29,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:29,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260762196] [2020-09-04 17:43:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:29,837 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:30,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:30,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 17:43:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:30,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 17:43:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:30,283 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 17:43:30,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260762196] [2020-09-04 17:43:30,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:30,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 17:43:30,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689942843] [2020-09-04 17:43:30,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 17:43:30,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 17:43:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2020-09-04 17:43:30,286 INFO L87 Difference]: Start difference. First operand 201 states and 213 transitions. Second operand 27 states. [2020-09-04 17:43:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:31,736 INFO L93 Difference]: Finished difference Result 370 states and 403 transitions. [2020-09-04 17:43:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-09-04 17:43:31,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 150 [2020-09-04 17:43:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:31,739 INFO L225 Difference]: With dead ends: 370 [2020-09-04 17:43:31,739 INFO L226 Difference]: Without dead ends: 259 [2020-09-04 17:43:31,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=1809, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 17:43:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-09-04 17:43:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 208. [2020-09-04 17:43:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-09-04 17:43:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 220 transitions. [2020-09-04 17:43:31,753 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 220 transitions. Word has length 150 [2020-09-04 17:43:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:31,754 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 220 transitions. [2020-09-04 17:43:31,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 17:43:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 220 transitions. [2020-09-04 17:43:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-04 17:43:31,756 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:31,756 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:31,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 17:43:31,756 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1474822175, now seen corresponding path program 7 times [2020-09-04 17:43:31,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:31,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862374153] [2020-09-04 17:43:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:31,764 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:32,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:32,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-09-04 17:43:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:32,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-09-04 17:43:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:32,253 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 17:43:32,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862374153] [2020-09-04 17:43:32,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:32,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-09-04 17:43:32,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206552541] [2020-09-04 17:43:32,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 17:43:32,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:32,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 17:43:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2020-09-04 17:43:32,259 INFO L87 Difference]: Start difference. First operand 208 states and 220 transitions. Second operand 29 states. [2020-09-04 17:43:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:33,542 INFO L93 Difference]: Finished difference Result 377 states and 410 transitions. [2020-09-04 17:43:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-09-04 17:43:33,543 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2020-09-04 17:43:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:33,545 INFO L225 Difference]: With dead ends: 377 [2020-09-04 17:43:33,545 INFO L226 Difference]: Without dead ends: 266 [2020-09-04 17:43:33,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=867, Invalid=2103, Unknown=0, NotChecked=0, Total=2970 [2020-09-04 17:43:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-09-04 17:43:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 215. [2020-09-04 17:43:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-09-04 17:43:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 227 transitions. [2020-09-04 17:43:33,559 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 227 transitions. Word has length 157 [2020-09-04 17:43:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:33,560 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 227 transitions. [2020-09-04 17:43:33,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 17:43:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 227 transitions. [2020-09-04 17:43:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-09-04 17:43:33,562 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:33,563 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:33,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 17:43:33,563 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:33,564 INFO L82 PathProgramCache]: Analyzing trace with hash 577946862, now seen corresponding path program 8 times [2020-09-04 17:43:33,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:33,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757726156] [2020-09-04 17:43:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:33,571 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:34,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:34,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-09-04 17:43:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:34,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 17:43:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:34,113 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 17:43:34,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757726156] [2020-09-04 17:43:34,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:34,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2020-09-04 17:43:34,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980713692] [2020-09-04 17:43:34,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-09-04 17:43:34,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:34,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-09-04 17:43:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2020-09-04 17:43:34,122 INFO L87 Difference]: Start difference. First operand 215 states and 227 transitions. Second operand 31 states. [2020-09-04 17:43:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:35,420 INFO L93 Difference]: Finished difference Result 384 states and 417 transitions. [2020-09-04 17:43:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-09-04 17:43:35,421 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 164 [2020-09-04 17:43:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:35,423 INFO L225 Difference]: With dead ends: 384 [2020-09-04 17:43:35,423 INFO L226 Difference]: Without dead ends: 273 [2020-09-04 17:43:35,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1003, Invalid=2419, Unknown=0, NotChecked=0, Total=3422 [2020-09-04 17:43:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-09-04 17:43:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2020-09-04 17:43:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-09-04 17:43:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 234 transitions. [2020-09-04 17:43:35,440 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 234 transitions. Word has length 164 [2020-09-04 17:43:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:35,440 INFO L479 AbstractCegarLoop]: Abstraction has 222 states and 234 transitions. [2020-09-04 17:43:35,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-09-04 17:43:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 234 transitions. [2020-09-04 17:43:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-09-04 17:43:35,443 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:35,443 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:35,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 17:43:35,443 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1374238401, now seen corresponding path program 9 times [2020-09-04 17:43:35,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:35,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1630966168] [2020-09-04 17:43:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:35,449 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:36,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:36,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 17:43:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:36,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-09-04 17:43:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:36,099 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 17:43:36,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1630966168] [2020-09-04 17:43:36,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:36,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2020-09-04 17:43:36,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819124771] [2020-09-04 17:43:36,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-09-04 17:43:36,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-09-04 17:43:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 17:43:36,103 INFO L87 Difference]: Start difference. First operand 222 states and 234 transitions. Second operand 33 states. [2020-09-04 17:43:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:38,236 INFO L93 Difference]: Finished difference Result 391 states and 424 transitions. [2020-09-04 17:43:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-09-04 17:43:38,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 171 [2020-09-04 17:43:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:38,240 INFO L225 Difference]: With dead ends: 391 [2020-09-04 17:43:38,240 INFO L226 Difference]: Without dead ends: 280 [2020-09-04 17:43:38,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1149, Invalid=2757, Unknown=0, NotChecked=0, Total=3906 [2020-09-04 17:43:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-04 17:43:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 229. [2020-09-04 17:43:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-09-04 17:43:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 241 transitions. [2020-09-04 17:43:38,257 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 241 transitions. Word has length 171 [2020-09-04 17:43:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:38,258 INFO L479 AbstractCegarLoop]: Abstraction has 229 states and 241 transitions. [2020-09-04 17:43:38,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-09-04 17:43:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 241 transitions. [2020-09-04 17:43:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-09-04 17:43:38,260 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:38,261 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:38,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 17:43:38,261 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash -454723634, now seen corresponding path program 10 times [2020-09-04 17:43:38,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:38,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391397305] [2020-09-04 17:43:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:38,289 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:38,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:38,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 17:43:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:38,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-09-04 17:43:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:38,961 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 17:43:38,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391397305] [2020-09-04 17:43:38,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:38,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2020-09-04 17:43:38,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033747924] [2020-09-04 17:43:38,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-09-04 17:43:38,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-09-04 17:43:38,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 17:43:38,964 INFO L87 Difference]: Start difference. First operand 229 states and 241 transitions. Second operand 35 states. [2020-09-04 17:43:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:40,325 INFO L93 Difference]: Finished difference Result 398 states and 431 transitions. [2020-09-04 17:43:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-09-04 17:43:40,325 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 178 [2020-09-04 17:43:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:40,328 INFO L225 Difference]: With dead ends: 398 [2020-09-04 17:43:40,328 INFO L226 Difference]: Without dead ends: 287 [2020-09-04 17:43:40,330 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1305, Invalid=3117, Unknown=0, NotChecked=0, Total=4422 [2020-09-04 17:43:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-09-04 17:43:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 236. [2020-09-04 17:43:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 17:43:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 248 transitions. [2020-09-04 17:43:40,346 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 248 transitions. Word has length 178 [2020-09-04 17:43:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:40,346 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 248 transitions. [2020-09-04 17:43:40,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-09-04 17:43:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 248 transitions. [2020-09-04 17:43:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-09-04 17:43:40,349 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:40,349 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:40,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 17:43:40,349 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash 496966239, now seen corresponding path program 11 times [2020-09-04 17:43:40,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:40,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [258316803] [2020-09-04 17:43:40,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:40,360 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:41,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:41,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-09-04 17:43:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:41,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 17:43:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:41,149 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 17:43:41,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [258316803] [2020-09-04 17:43:41,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:41,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2020-09-04 17:43:41,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378769416] [2020-09-04 17:43:41,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-09-04 17:43:41,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-09-04 17:43:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2020-09-04 17:43:41,152 INFO L87 Difference]: Start difference. First operand 236 states and 248 transitions. Second operand 37 states. [2020-09-04 17:43:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:43,573 INFO L93 Difference]: Finished difference Result 405 states and 438 transitions. [2020-09-04 17:43:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-09-04 17:43:43,574 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 185 [2020-09-04 17:43:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:43,577 INFO L225 Difference]: With dead ends: 405 [2020-09-04 17:43:43,578 INFO L226 Difference]: Without dead ends: 294 [2020-09-04 17:43:43,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1471, Invalid=3499, Unknown=0, NotChecked=0, Total=4970 [2020-09-04 17:43:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-09-04 17:43:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 243. [2020-09-04 17:43:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-09-04 17:43:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 255 transitions. [2020-09-04 17:43:43,597 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 255 transitions. Word has length 185 [2020-09-04 17:43:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:43,597 INFO L479 AbstractCegarLoop]: Abstraction has 243 states and 255 transitions. [2020-09-04 17:43:43,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-09-04 17:43:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 255 transitions. [2020-09-04 17:43:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-09-04 17:43:43,599 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:43,599 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:43,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 17:43:43,599 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:43,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1481268562, now seen corresponding path program 12 times [2020-09-04 17:43:43,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:43,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51356816] [2020-09-04 17:43:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:43,615 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:43,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:43,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-09-04 17:43:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:43,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-09-04 17:43:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:43,737 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 17:43:43,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51356816] [2020-09-04 17:43:43,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:43,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:43:43,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687306039] [2020-09-04 17:43:43,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:43:43,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:43:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:43:43,741 INFO L87 Difference]: Start difference. First operand 243 states and 255 transitions. Second operand 6 states. [2020-09-04 17:43:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:43,990 INFO L93 Difference]: Finished difference Result 327 states and 350 transitions. [2020-09-04 17:43:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:43:43,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2020-09-04 17:43:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:43,995 INFO L225 Difference]: With dead ends: 327 [2020-09-04 17:43:43,995 INFO L226 Difference]: Without dead ends: 249 [2020-09-04 17:43:43,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:43:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-09-04 17:43:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2020-09-04 17:43:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-09-04 17:43:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2020-09-04 17:43:44,019 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 192 [2020-09-04 17:43:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:44,020 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2020-09-04 17:43:44,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:43:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2020-09-04 17:43:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 17:43:44,032 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:43:44,033 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:43:44,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 17:43:44,033 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:43:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:43:44,033 INFO L82 PathProgramCache]: Analyzing trace with hash 471722044, now seen corresponding path program 1 times [2020-09-04 17:43:44,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:43:44,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412189791] [2020-09-04 17:43:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:43:44,037 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:43:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:44,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:43:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:44,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-09-04 17:43:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:44,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 17:43:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:43:44,236 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 17:43:44,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412189791] [2020-09-04 17:43:44,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:43:44,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:43:44,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512963499] [2020-09-04 17:43:44,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:43:44,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:43:44,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:43:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:43:44,244 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 8 states. [2020-09-04 17:43:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:43:44,514 INFO L93 Difference]: Finished difference Result 293 states and 310 transitions. [2020-09-04 17:43:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 17:43:44,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2020-09-04 17:43:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:43:44,515 INFO L225 Difference]: With dead ends: 293 [2020-09-04 17:43:44,515 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:43:44,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:43:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:43:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:43:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:43:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:43:44,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2020-09-04 17:43:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:43:44,518 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:43:44,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:43:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:43:44,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:43:44,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 17:43:44,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:43:44,737 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 3 [2020-09-04 17:43:44,867 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 3 [2020-09-04 17:43:45,119 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 3 [2020-09-04 17:43:45,230 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 3 [2020-09-04 17:43:45,358 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 3 [2020-09-04 17:43:46,319 INFO L271 CegarLoopResult]: At program point elem_existsENTRY(lines 9 15) the Hoare annotation is: true [2020-09-04 17:43:46,320 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (= elem_exists_~size |elem_exists_#in~size|) [2020-09-04 17:43:46,320 INFO L271 CegarLoopResult]: At program point L9(lines 9 15) the Hoare annotation is: true [2020-09-04 17:43:46,320 INFO L264 CegarLoopResult]: At program point elem_existsFINAL(lines 9 15) the Hoare annotation is: (let ((.cse0 (= elem_exists_~size |elem_exists_#in~size|))) (or (and (<= 0 |elem_exists_#res|) (<= 0 elem_exists_~i~0) .cse0 (<= |elem_exists_#res| 0)) (and .cse0 (<= 1 |elem_exists_#in~size|)))) [2020-09-04 17:43:46,320 INFO L264 CegarLoopResult]: At program point L9-1(lines 9 15) the Hoare annotation is: (= elem_exists_~size |elem_exists_#in~size|) [2020-09-04 17:43:46,320 INFO L264 CegarLoopResult]: At program point L11-3(lines 11 13) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,321 INFO L264 CegarLoopResult]: At program point L11-4(line 11) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,321 INFO L264 CegarLoopResult]: At program point L11-5(line 11) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,321 INFO L264 CegarLoopResult]: At program point L11-6(lines 11 13) the Hoare annotation is: (let ((.cse0 (= elem_exists_~size |elem_exists_#in~size|))) (or (and (<= 0 elem_exists_~i~0) .cse0) (and .cse0 (<= 1 |elem_exists_#in~size|)))) [2020-09-04 17:43:46,322 INFO L264 CegarLoopResult]: At program point L11-7(lines 11 13) the Hoare annotation is: (and (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|)) [2020-09-04 17:43:46,322 INFO L264 CegarLoopResult]: At program point elem_existsEXIT(lines 9 15) the Hoare annotation is: (let ((.cse0 (= elem_exists_~size |elem_exists_#in~size|))) (or (and (<= 0 |elem_exists_#res|) (<= 0 elem_exists_~i~0) .cse0 (<= |elem_exists_#res| 0)) (and .cse0 (<= 1 |elem_exists_#in~size|)))) [2020-09-04 17:43:46,322 INFO L264 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,322 INFO L264 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,322 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (= elem_exists_~size |elem_exists_#in~size|) [2020-09-04 17:43:46,322 INFO L264 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,323 INFO L264 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,323 INFO L264 CegarLoopResult]: At program point L12-4(line 12) the Hoare annotation is: (and (= elem_exists_~size |elem_exists_#in~size|) (<= 1 |elem_exists_#in~size|)) [2020-09-04 17:43:46,323 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,323 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,323 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,323 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-09-04 17:43:46,323 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point insertENTRY(lines 5 8) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point insertFINAL(lines 5 8) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point L5(lines 5 8) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point L5-1(lines 5 8) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point insertEXIT(lines 5 8) the Hoare annotation is: true [2020-09-04 17:43:46,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,325 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,325 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,325 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:43:46,325 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 16 56) the Hoare annotation is: true [2020-09-04 17:43:46,325 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: false [2020-09-04 17:43:46,325 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: false [2020-09-04 17:43:46,325 INFO L264 CegarLoopResult]: At program point L52-2(line 52) the Hoare annotation is: false [2020-09-04 17:43:46,325 INFO L264 CegarLoopResult]: At program point L52-3(line 52) the Hoare annotation is: false [2020-09-04 17:43:46,326 INFO L264 CegarLoopResult]: At program point L52-4(line 52) the Hoare annotation is: false [2020-09-04 17:43:46,326 INFO L264 CegarLoopResult]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2020-09-04 17:43:46,326 INFO L264 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: false [2020-09-04 17:43:46,326 INFO L264 CegarLoopResult]: At program point L44-4(line 44) the Hoare annotation is: false [2020-09-04 17:43:46,326 INFO L264 CegarLoopResult]: At program point L44-5(lines 44 48) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,326 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,327 INFO L264 CegarLoopResult]: At program point L36-3(lines 36 39) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,327 INFO L264 CegarLoopResult]: At program point L36-4(line 36) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,327 INFO L264 CegarLoopResult]: At program point L36-5(line 36) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,327 INFO L264 CegarLoopResult]: At program point L36-6(lines 36 39) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,327 INFO L264 CegarLoopResult]: At program point L36-7(lines 36 39) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,327 INFO L264 CegarLoopResult]: At program point L28-2(lines 28 32) the Hoare annotation is: false [2020-09-04 17:43:46,327 INFO L264 CegarLoopResult]: At program point L28-3(line 28) the Hoare annotation is: false [2020-09-04 17:43:46,328 INFO L264 CegarLoopResult]: At program point L28-4(line 28) the Hoare annotation is: false [2020-09-04 17:43:46,328 INFO L264 CegarLoopResult]: At program point L28-5(lines 28 32) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,328 INFO L264 CegarLoopResult]: At program point L28-6(lines 28 32) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,328 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= main_~n~0 0)) [2020-09-04 17:43:46,328 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: false [2020-09-04 17:43:46,328 INFO L264 CegarLoopResult]: At program point L45-3(lines 45 47) the Hoare annotation is: false [2020-09-04 17:43:46,328 INFO L264 CegarLoopResult]: At program point L45-4(line 45) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L45-5(line 45) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L45-6(lines 45 47) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L29-4(line 29) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L29-5(line 29) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L29-6(lines 29 31) the Hoare annotation is: false [2020-09-04 17:43:46,329 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-09-04 17:43:46,330 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: false [2020-09-04 17:43:46,330 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 16 56) the Hoare annotation is: true [2020-09-04 17:43:46,330 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: false [2020-09-04 17:43:46,330 INFO L264 CegarLoopResult]: At program point L46-3(line 46) the Hoare annotation is: false [2020-09-04 17:43:46,330 INFO L264 CegarLoopResult]: At program point L46-4(line 46) the Hoare annotation is: false [2020-09-04 17:43:46,330 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,330 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point L38-2(line 38) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: false [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 16 56) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: false [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: false [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point L30-3(line 30) the Hoare annotation is: false [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point L30-4(line 30) the Hoare annotation is: false [2020-09-04 17:43:46,331 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= main_~n~0 0)) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L22-3(lines 22 25) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L22-6(lines 22 25) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L22-7(lines 22 25) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L40-2(lines 40 49) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L40-3(line 40) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,332 INFO L264 CegarLoopResult]: At program point L40-4(line 40) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,333 INFO L264 CegarLoopResult]: At program point L40-5(lines 40 49) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,333 INFO L264 CegarLoopResult]: At program point L40-6(lines 40 49) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,333 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,333 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,333 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (= main_~n~0 0) [2020-09-04 17:43:46,333 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,333 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,334 INFO L264 CegarLoopResult]: At program point L41-2(line 41) the Hoare annotation is: (and (= main_~x~0 0) (= |main_#t~ret12| 0) (= main_~n~0 0)) [2020-09-04 17:43:46,334 INFO L264 CegarLoopResult]: At program point L41-3(lines 41 43) the Hoare annotation is: (and (= main_~x~0 0) (= |main_#t~ret12| 0) (= main_~n~0 0)) [2020-09-04 17:43:46,334 INFO L264 CegarLoopResult]: At program point L41-4(line 41) the Hoare annotation is: false [2020-09-04 17:43:46,334 INFO L264 CegarLoopResult]: At program point L41-5(line 41) the Hoare annotation is: false [2020-09-04 17:43:46,334 INFO L264 CegarLoopResult]: At program point L41-7(line 41) the Hoare annotation is: (and (= main_~x~0 0) (= |main_#t~ret12| 0) (= main_~n~0 0)) [2020-09-04 17:43:46,334 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,334 INFO L264 CegarLoopResult]: At program point L41-8(line 41) the Hoare annotation is: (and (= main_~x~0 0) (= |main_#t~ret12| 0) (= main_~n~0 0)) [2020-09-04 17:43:46,335 INFO L264 CegarLoopResult]: At program point L41-9(lines 41 43) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,335 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-09-04 17:43:46,335 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-09-04 17:43:46,335 INFO L264 CegarLoopResult]: At program point L50-2(lines 50 54) the Hoare annotation is: false [2020-09-04 17:43:46,335 INFO L264 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: false [2020-09-04 17:43:46,335 INFO L264 CegarLoopResult]: At program point L50-4(line 50) the Hoare annotation is: false [2020-09-04 17:43:46,335 INFO L264 CegarLoopResult]: At program point L50-5(lines 50 54) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2020-09-04 17:43:46,335 INFO L271 CegarLoopResult]: At program point L50-6(lines 50 54) the Hoare annotation is: true [2020-09-04 17:43:46,336 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: false [2020-09-04 17:43:46,336 INFO L264 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: false [2020-09-04 17:43:46,336 INFO L264 CegarLoopResult]: At program point L42-2(line 42) the Hoare annotation is: false [2020-09-04 17:43:46,336 INFO L264 CegarLoopResult]: At program point L42-3(line 42) the Hoare annotation is: false [2020-09-04 17:43:46,336 INFO L264 CegarLoopResult]: At program point L42-4(line 42) the Hoare annotation is: false [2020-09-04 17:43:46,336 INFO L264 CegarLoopResult]: At program point L42-5(line 42) the Hoare annotation is: false [2020-09-04 17:43:46,336 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: false [2020-09-04 17:43:46,337 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|) (= main_~n~0 0)) [2020-09-04 17:43:46,337 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= main_~n~0 0)) [2020-09-04 17:43:46,337 INFO L264 CegarLoopResult]: At program point L51-3(lines 51 53) the Hoare annotation is: false [2020-09-04 17:43:46,337 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 17:43:46,337 INFO L264 CegarLoopResult]: At program point L51-4(line 51) the Hoare annotation is: false [2020-09-04 17:43:46,337 INFO L271 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: true [2020-09-04 17:43:46,337 INFO L264 CegarLoopResult]: At program point L51-5(line 51) the Hoare annotation is: false [2020-09-04 17:43:46,338 INFO L264 CegarLoopResult]: At program point L51-6(lines 51 53) the Hoare annotation is: false [2020-09-04 17:43:46,338 INFO L271 CegarLoopResult]: At program point L2-1(line 2) the Hoare annotation is: true [2020-09-04 17:43:46,338 INFO L271 CegarLoopResult]: At program point L2-3(line 2) the Hoare annotation is: true [2020-09-04 17:43:46,338 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2020-09-04 17:43:46,338 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(line 2) the Hoare annotation is: true [2020-09-04 17:43:46,338 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) the Hoare annotation is: true [2020-09-04 17:43:46,338 INFO L271 CegarLoopResult]: At program point L2(line 2) the Hoare annotation is: true [2020-09-04 17:43:46,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:43:46 BoogieIcfgContainer [2020-09-04 17:43:46,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:43:46,368 INFO L168 Benchmark]: Toolchain (without parser) took 31959.17 ms. Allocated memory was 140.0 MB in the beginning and 473.4 MB in the end (delta: 333.4 MB). Free memory was 103.4 MB in the beginning and 402.6 MB in the end (delta: -299.2 MB). Peak memory consumption was 330.6 MB. Max. memory is 7.1 GB. [2020-09-04 17:43:46,369 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 17:43:46,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.33 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.2 MB in the beginning and 183.5 MB in the end (delta: -80.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2020-09-04 17:43:46,370 INFO L168 Benchmark]: Boogie Preprocessor took 52.46 ms. Allocated memory is still 204.5 MB. Free memory was 183.5 MB in the beginning and 180.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-09-04 17:43:46,371 INFO L168 Benchmark]: RCFGBuilder took 570.31 ms. Allocated memory is still 204.5 MB. Free memory was 180.5 MB in the beginning and 151.8 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2020-09-04 17:43:46,371 INFO L168 Benchmark]: TraceAbstraction took 30878.80 ms. Allocated memory was 204.5 MB in the beginning and 473.4 MB in the end (delta: 269.0 MB). Free memory was 151.2 MB in the beginning and 402.6 MB in the end (delta: -251.4 MB). Peak memory consumption was 313.9 MB. Max. memory is 7.1 GB. [2020-09-04 17:43:46,373 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.30 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.33 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.2 MB in the beginning and 183.5 MB in the end (delta: -80.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.46 ms. Allocated memory is still 204.5 MB. Free memory was 183.5 MB in the beginning and 180.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 570.31 ms. Allocated memory is still 204.5 MB. Free memory was 180.5 MB in the beginning and 151.8 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30878.80 ms. Allocated memory was 204.5 MB in the beginning and 473.4 MB in the end (delta: 269.0 MB). Free memory was 151.2 MB in the beginning and 402.6 MB in the end (delta: -251.4 MB). Peak memory consumption was 313.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (0 <= i && size == \old(size)) || (size == \old(size) && 1 <= \old(size)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: n == 0 - ProcedureContractResult [Line: 9]: Procedure Contract for elem_exists Derived contract for procedure elem_exists: (((0 <= \result && 0 <= i) && size == \old(size)) && \result <= 0) || (size == \old(size) && 1 <= \old(size)) - ProcedureContractResult [Line: 5]: Procedure Contract for insert Derived contract for procedure insert: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 2]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.9s, OverallIterations: 23, TraceHistogramMax: 17, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2530 SDtfs, 3644 SDslu, 15779 SDs, 0 SdLazy, 14762 SolverSat, 746 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5293 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 1027 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 132 LocationsWithAnnotation, 1266 PreInvPairs, 1441 NumberOfFragments, 472 HoareAnnotationTreeSize, 1266 FomulaSimplifications, 1230460 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 132 FomulaSimplificationsInter, 266 FormulaSimplificationTreeSizeReductionInter, 0.5s 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...