/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:11:10,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:11:10,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:11:10,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:11:10,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:11:10,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:11:10,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:11:10,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:11:10,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:11:10,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:11:10,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:11:10,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:11:10,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:11:10,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:11:10,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:11:10,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:11:10,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:11:10,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:11:10,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:11:10,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:11:10,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:11:10,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:11:10,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:11:10,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:11:10,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:11:10,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:11:10,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:11:10,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:11:10,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:11:10,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:11:10,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:11:10,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:11:10,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:11:10,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:11:10,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:11:10,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:11:10,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:11:10,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:11:10,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:11:10,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:11:10,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:11:10,336 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 23:11:10,348 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:11:10,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:11:10,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:11:10,350 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:11:10,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:11:10,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:11:10,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:11:10,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:11:10,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:11:10,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:11:10,352 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:11:10,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:11:10,352 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:11:10,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:11:10,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:11:10,353 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:11:10,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:11:10,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:11:10,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:11:10,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:11:10,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:11:10,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:11:10,354 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:11:10,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:11:10,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:11:10,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:11:10,864 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:11:10,865 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:11:10,866 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-09-04 23:11:10,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/65c19491c/f0dfa6bf52774c7db8f234601e7e558f/FLAG4e71015f4 [2020-09-04 23:11:11,548 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:11:11,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-09-04 23:11:11,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/65c19491c/f0dfa6bf52774c7db8f234601e7e558f/FLAG4e71015f4 [2020-09-04 23:11:11,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/65c19491c/f0dfa6bf52774c7db8f234601e7e558f [2020-09-04 23:11:11,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:11:11,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:11:11,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:11:11,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:11:11,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:11:11,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:11:11" (1/1) ... [2020-09-04 23:11:11,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b12c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:11, skipping insertion in model container [2020-09-04 23:11:11,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:11:11" (1/1) ... [2020-09-04 23:11:11,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:11:11,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:11:12,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:11:12,233 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:11:12,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:11:12,393 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:11:12,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12 WrapperNode [2020-09-04 23:11:12,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:11:12,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:11:12,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:11:12,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:11:12,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (1/1) ... [2020-09-04 23:11:12,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (1/1) ... [2020-09-04 23:11:12,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (1/1) ... [2020-09-04 23:11:12,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (1/1) ... [2020-09-04 23:11:12,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (1/1) ... [2020-09-04 23:11:12,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (1/1) ... [2020-09-04 23:11:12,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (1/1) ... [2020-09-04 23:11:12,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:11:12,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:11:12,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:11:12,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:11:12,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (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 23:11:12,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:11:12,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:11:12,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:11:12,557 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-09-04 23:11:12,557 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-09-04 23:11:12,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:11:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:11:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:11:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-09-04 23:11:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-09-04 23:11:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-09-04 23:11:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-09-04 23:11:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-09-04 23:11:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-09-04 23:11:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-09-04 23:11:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-09-04 23:11:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-09-04 23:11:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-09-04 23:11:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-09-04 23:11:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-09-04 23:11:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-09-04 23:11:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-09-04 23:11:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-09-04 23:11:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-09-04 23:11:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-09-04 23:11:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-09-04 23:11:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-09-04 23:11:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-09-04 23:11:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-09-04 23:11:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-09-04 23:11:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-09-04 23:11:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-09-04 23:11:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-09-04 23:11:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-09-04 23:11:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 23:11:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 23:11:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 23:11:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 23:11:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:11:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:11:12,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:11:13,092 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:11:13,092 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-09-04 23:11:13,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:11:13 BoogieIcfgContainer [2020-09-04 23:11:13,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:11:13,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:11:13,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:11:13,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:11:13,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:11:11" (1/3) ... [2020-09-04 23:11:13,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f39bbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:11:13, skipping insertion in model container [2020-09-04 23:11:13,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:11:12" (2/3) ... [2020-09-04 23:11:13,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f39bbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:11:13, skipping insertion in model container [2020-09-04 23:11:13,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:11:13" (3/3) ... [2020-09-04 23:11:13,112 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-09-04 23:11:13,125 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:11:13,137 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:11:13,163 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:11:13,196 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:11:13,197 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:11:13,197 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:11:13,197 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:11:13,197 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:11:13,197 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:11:13,197 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:11:13,198 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:11:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2020-09-04 23:11:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 23:11:13,236 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:13,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:13,238 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:13,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2116113079, now seen corresponding path program 1 times [2020-09-04 23:11:13,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:13,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371127031] [2020-09-04 23:11:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:13,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:13,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:11:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:13,547 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 23:11:13,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371127031] [2020-09-04 23:11:13,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:13,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 23:11:13,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628053389] [2020-09-04 23:11:13,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 23:11:13,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 23:11:13,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:11:13,584 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2020-09-04 23:11:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:13,908 INFO L93 Difference]: Finished difference Result 227 states and 257 transitions. [2020-09-04 23:11:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 23:11:13,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-09-04 23:11:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:13,925 INFO L225 Difference]: With dead ends: 227 [2020-09-04 23:11:13,926 INFO L226 Difference]: Without dead ends: 102 [2020-09-04 23:11:13,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 23:11:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-09-04 23:11:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-09-04 23:11:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-09-04 23:11:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-09-04 23:11:14,013 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 48 [2020-09-04 23:11:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:14,015 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-09-04 23:11:14,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 23:11:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-09-04 23:11:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-04 23:11:14,024 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:14,024 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, 1, 1, 1, 1, 1, 1, 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 23:11:14,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:11:14,025 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1227098254, now seen corresponding path program 1 times [2020-09-04 23:11:14,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:14,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370805903] [2020-09-04 23:11:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:14,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:14,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 23:11:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:14,194 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 23:11:14,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370805903] [2020-09-04 23:11:14,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:14,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 23:11:14,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989395065] [2020-09-04 23:11:14,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 23:11:14,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:14,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 23:11:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 23:11:14,199 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 4 states. [2020-09-04 23:11:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:14,442 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2020-09-04 23:11:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 23:11:14,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-09-04 23:11:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:14,445 INFO L225 Difference]: With dead ends: 189 [2020-09-04 23:11:14,445 INFO L226 Difference]: Without dead ends: 103 [2020-09-04 23:11:14,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 23:11:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-09-04 23:11:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-09-04 23:11:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 23:11:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2020-09-04 23:11:14,464 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 60 [2020-09-04 23:11:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:14,465 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2020-09-04 23:11:14,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 23:11:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2020-09-04 23:11:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 23:11:14,467 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:14,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:14,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:11:14,468 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1578191403, now seen corresponding path program 1 times [2020-09-04 23:11:14,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:14,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [278854295] [2020-09-04 23:11:14,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:14,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:14,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 23:11:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:14,689 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 23:11:14,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [278854295] [2020-09-04 23:11:14,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:14,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:11:14,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703367460] [2020-09-04 23:11:14,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:11:14,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:11:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:11:14,692 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 8 states. [2020-09-04 23:11:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:15,184 INFO L93 Difference]: Finished difference Result 365 states and 410 transitions. [2020-09-04 23:11:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 23:11:15,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-09-04 23:11:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:15,199 INFO L225 Difference]: With dead ends: 365 [2020-09-04 23:11:15,200 INFO L226 Difference]: Without dead ends: 275 [2020-09-04 23:11:15,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:11:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-09-04 23:11:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 140. [2020-09-04 23:11:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-04 23:11:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2020-09-04 23:11:15,262 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 62 [2020-09-04 23:11:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:15,263 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2020-09-04 23:11:15,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:11:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2020-09-04 23:11:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 23:11:15,266 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:15,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:15,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:11:15,267 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:15,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1116699365, now seen corresponding path program 1 times [2020-09-04 23:11:15,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:15,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2013110717] [2020-09-04 23:11:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:15,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:15,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 23:11:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:15,480 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 23:11:15,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2013110717] [2020-09-04 23:11:15,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:15,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:11:15,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452077364] [2020-09-04 23:11:15,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:11:15,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:11:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:11:15,483 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand 10 states. [2020-09-04 23:11:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:16,125 INFO L93 Difference]: Finished difference Result 430 states and 486 transitions. [2020-09-04 23:11:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 23:11:16,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-09-04 23:11:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:16,130 INFO L225 Difference]: With dead ends: 430 [2020-09-04 23:11:16,131 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 23:11:16,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:11:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 23:11:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 144. [2020-09-04 23:11:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-09-04 23:11:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 161 transitions. [2020-09-04 23:11:16,160 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 161 transitions. Word has length 65 [2020-09-04 23:11:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:16,164 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 161 transitions. [2020-09-04 23:11:16,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:11:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2020-09-04 23:11:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 23:11:16,166 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:16,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:16,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:11:16,175 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:16,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:16,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1492663361, now seen corresponding path program 1 times [2020-09-04 23:11:16,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:16,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923422613] [2020-09-04 23:11:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:16,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:16,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 23:11:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:16,256 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 23:11:16,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923422613] [2020-09-04 23:11:16,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:16,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 23:11:16,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362249697] [2020-09-04 23:11:16,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 23:11:16,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 23:11:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 23:11:16,259 INFO L87 Difference]: Start difference. First operand 144 states and 161 transitions. Second operand 4 states. [2020-09-04 23:11:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:16,461 INFO L93 Difference]: Finished difference Result 233 states and 260 transitions. [2020-09-04 23:11:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 23:11:16,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-09-04 23:11:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:16,467 INFO L225 Difference]: With dead ends: 233 [2020-09-04 23:11:16,468 INFO L226 Difference]: Without dead ends: 145 [2020-09-04 23:11:16,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 23:11:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-04 23:11:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-09-04 23:11:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 23:11:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2020-09-04 23:11:16,484 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 65 [2020-09-04 23:11:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:16,484 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2020-09-04 23:11:16,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 23:11:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2020-09-04 23:11:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 23:11:16,486 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:16,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:16,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:11:16,487 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1492389340, now seen corresponding path program 1 times [2020-09-04 23:11:16,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:16,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314916839] [2020-09-04 23:11:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:16,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:16,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 23:11:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:16,679 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 23:11:16,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314916839] [2020-09-04 23:11:16,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:16,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:11:16,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335739569] [2020-09-04 23:11:16,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:11:16,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:11:16,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:11:16,684 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand 10 states. [2020-09-04 23:11:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:17,264 INFO L93 Difference]: Finished difference Result 388 states and 434 transitions. [2020-09-04 23:11:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:11:17,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2020-09-04 23:11:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:17,267 INFO L225 Difference]: With dead ends: 388 [2020-09-04 23:11:17,268 INFO L226 Difference]: Without dead ends: 285 [2020-09-04 23:11:17,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-09-04 23:11:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-09-04 23:11:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 155. [2020-09-04 23:11:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-04 23:11:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2020-09-04 23:11:17,292 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 67 [2020-09-04 23:11:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:17,292 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2020-09-04 23:11:17,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:11:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2020-09-04 23:11:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 23:11:17,296 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:17,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:17,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:11:17,298 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 122758570, now seen corresponding path program 1 times [2020-09-04 23:11:17,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:17,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [717359373] [2020-09-04 23:11:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:17,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:17,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 23:11:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:17,508 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 23:11:17,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [717359373] [2020-09-04 23:11:17,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:17,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 23:11:17,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422974583] [2020-09-04 23:11:17,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:11:17,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:11:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:11:17,512 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand 12 states. [2020-09-04 23:11:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:18,182 INFO L93 Difference]: Finished difference Result 425 states and 477 transitions. [2020-09-04 23:11:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:11:18,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2020-09-04 23:11:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:18,188 INFO L225 Difference]: With dead ends: 425 [2020-09-04 23:11:18,188 INFO L226 Difference]: Without dead ends: 322 [2020-09-04 23:11:18,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:11:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-09-04 23:11:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 136. [2020-09-04 23:11:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-09-04 23:11:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2020-09-04 23:11:18,207 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 70 [2020-09-04 23:11:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:18,207 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2020-09-04 23:11:18,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:11:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2020-09-04 23:11:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 23:11:18,213 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:18,214 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:18,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:11:18,214 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash -272178825, now seen corresponding path program 1 times [2020-09-04 23:11:18,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:18,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [492717655] [2020-09-04 23:11:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:18,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:18,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:11:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:11:18,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [492717655] [2020-09-04 23:11:18,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:18,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 23:11:18,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109219631] [2020-09-04 23:11:18,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 23:11:18,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 23:11:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 23:11:18,308 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand 4 states. [2020-09-04 23:11:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:18,480 INFO L93 Difference]: Finished difference Result 226 states and 251 transitions. [2020-09-04 23:11:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 23:11:18,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-09-04 23:11:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:18,483 INFO L225 Difference]: With dead ends: 226 [2020-09-04 23:11:18,483 INFO L226 Difference]: Without dead ends: 137 [2020-09-04 23:11:18,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 23:11:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-09-04 23:11:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-09-04 23:11:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-09-04 23:11:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2020-09-04 23:11:18,497 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 72 [2020-09-04 23:11:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:18,498 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2020-09-04 23:11:18,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 23:11:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2020-09-04 23:11:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 23:11:18,500 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:18,500 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:18,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:11:18,500 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash 588909148, now seen corresponding path program 1 times [2020-09-04 23:11:18,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:18,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145977503] [2020-09-04 23:11:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:18,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:18,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 23:11:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:11:18,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145977503] [2020-09-04 23:11:18,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:11:18,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:11:18,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83472291] [2020-09-04 23:11:18,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:11:18,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:11:18,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:11:18,702 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 10 states. [2020-09-04 23:11:19,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:19,276 INFO L93 Difference]: Finished difference Result 389 states and 436 transitions. [2020-09-04 23:11:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:11:19,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2020-09-04 23:11:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:19,279 INFO L225 Difference]: With dead ends: 389 [2020-09-04 23:11:19,279 INFO L226 Difference]: Without dead ends: 296 [2020-09-04 23:11:19,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-09-04 23:11:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-09-04 23:11:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 200. [2020-09-04 23:11:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-04 23:11:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2020-09-04 23:11:19,296 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 72 [2020-09-04 23:11:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:19,297 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2020-09-04 23:11:19,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:11:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2020-09-04 23:11:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 23:11:19,298 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:19,299 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:19,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:11:19,299 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash 69190993, now seen corresponding path program 1 times [2020-09-04 23:11:19,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:19,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846810388] [2020-09-04 23:11:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:19,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:19,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 23:11:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 23:11:19,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [846810388] [2020-09-04 23:11:19,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:19,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:11:19,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334848343] [2020-09-04 23:11:19,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:11:19,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:19,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:11:19,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:11:19,417 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 8 states. [2020-09-04 23:11:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:19,896 INFO L93 Difference]: Finished difference Result 288 states and 323 transitions. [2020-09-04 23:11:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:11:19,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-09-04 23:11:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:19,899 INFO L225 Difference]: With dead ends: 288 [2020-09-04 23:11:19,899 INFO L226 Difference]: Without dead ends: 286 [2020-09-04 23:11:19,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:11:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-09-04 23:11:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 254. [2020-09-04 23:11:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-09-04 23:11:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2020-09-04 23:11:19,920 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 73 [2020-09-04 23:11:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:19,921 INFO L479 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2020-09-04 23:11:19,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:11:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2020-09-04 23:11:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-09-04 23:11:19,924 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:19,924 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:19,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:11:19,924 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1474625812, now seen corresponding path program 1 times [2020-09-04 23:11:19,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:19,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064097469] [2020-09-04 23:11:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:20,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:20,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 23:11:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:11:20,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064097469] [2020-09-04 23:11:20,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:11:20,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:11:20,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299785777] [2020-09-04 23:11:20,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:11:20,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:11:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:11:20,072 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand 12 states. [2020-09-04 23:11:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:20,857 INFO L93 Difference]: Finished difference Result 460 states and 517 transitions. [2020-09-04 23:11:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:11:20,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2020-09-04 23:11:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:20,864 INFO L225 Difference]: With dead ends: 460 [2020-09-04 23:11:20,864 INFO L226 Difference]: Without dead ends: 367 [2020-09-04 23:11:20,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:11:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2020-09-04 23:11:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 258. [2020-09-04 23:11:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-09-04 23:11:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 289 transitions. [2020-09-04 23:11:20,891 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 289 transitions. Word has length 75 [2020-09-04 23:11:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:20,891 INFO L479 AbstractCegarLoop]: Abstraction has 258 states and 289 transitions. [2020-09-04 23:11:20,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:11:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 289 transitions. [2020-09-04 23:11:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-09-04 23:11:20,893 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:20,893 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:20,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:11:20,894 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1908172287, now seen corresponding path program 1 times [2020-09-04 23:11:20,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:20,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76829474] [2020-09-04 23:11:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:20,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:20,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:11:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 23:11:21,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76829474] [2020-09-04 23:11:21,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:21,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:11:21,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448113286] [2020-09-04 23:11:21,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:11:21,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:11:21,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:11:21,016 INFO L87 Difference]: Start difference. First operand 258 states and 289 transitions. Second operand 8 states. [2020-09-04 23:11:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:21,530 INFO L93 Difference]: Finished difference Result 432 states and 485 transitions. [2020-09-04 23:11:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 23:11:21,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-09-04 23:11:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:21,534 INFO L225 Difference]: With dead ends: 432 [2020-09-04 23:11:21,534 INFO L226 Difference]: Without dead ends: 339 [2020-09-04 23:11:21,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 23:11:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-09-04 23:11:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 258. [2020-09-04 23:11:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-09-04 23:11:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 289 transitions. [2020-09-04 23:11:21,557 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 289 transitions. Word has length 76 [2020-09-04 23:11:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:21,557 INFO L479 AbstractCegarLoop]: Abstraction has 258 states and 289 transitions. [2020-09-04 23:11:21,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:11:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 289 transitions. [2020-09-04 23:11:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-09-04 23:11:21,560 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:21,560 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:21,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 23:11:21,560 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash 116425250, now seen corresponding path program 1 times [2020-09-04 23:11:21,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:21,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193302659] [2020-09-04 23:11:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:21,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:21,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 23:11:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 23:11:21,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193302659] [2020-09-04 23:11:21,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:21,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 23:11:21,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204233545] [2020-09-04 23:11:21,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:11:21,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:11:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:11:21,617 INFO L87 Difference]: Start difference. First operand 258 states and 289 transitions. Second operand 5 states. [2020-09-04 23:11:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:21,815 INFO L93 Difference]: Finished difference Result 369 states and 412 transitions. [2020-09-04 23:11:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:11:21,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2020-09-04 23:11:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:21,818 INFO L225 Difference]: With dead ends: 369 [2020-09-04 23:11:21,818 INFO L226 Difference]: Without dead ends: 280 [2020-09-04 23:11:21,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:11:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-09-04 23:11:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 260. [2020-09-04 23:11:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-09-04 23:11:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2020-09-04 23:11:21,839 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 76 [2020-09-04 23:11:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:21,839 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2020-09-04 23:11:21,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:11:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2020-09-04 23:11:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 23:11:21,842 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:21,842 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:21,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 23:11:21,843 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:21,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1122457453, now seen corresponding path program 1 times [2020-09-04 23:11:21,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:21,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899816998] [2020-09-04 23:11:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:21,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:21,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 23:11:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 23:11:21,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899816998] [2020-09-04 23:11:21,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:21,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:11:21,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055007892] [2020-09-04 23:11:21,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:11:21,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:11:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:11:21,921 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand 6 states. [2020-09-04 23:11:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:22,221 INFO L93 Difference]: Finished difference Result 411 states and 459 transitions. [2020-09-04 23:11:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:11:22,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-09-04 23:11:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:22,224 INFO L225 Difference]: With dead ends: 411 [2020-09-04 23:11:22,224 INFO L226 Difference]: Without dead ends: 297 [2020-09-04 23:11:22,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:11:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-09-04 23:11:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 253. [2020-09-04 23:11:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-09-04 23:11:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 281 transitions. [2020-09-04 23:11:22,262 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 281 transitions. Word has length 77 [2020-09-04 23:11:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:22,263 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 281 transitions. [2020-09-04 23:11:22,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:11:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 281 transitions. [2020-09-04 23:11:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 23:11:22,265 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:22,265 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:11:22,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 23:11:22,265 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2031617893, now seen corresponding path program 1 times [2020-09-04 23:11:22,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:22,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223995008] [2020-09-04 23:11:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:22,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:22,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 23:11:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 23:11:22,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223995008] [2020-09-04 23:11:22,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:22,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 23:11:22,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111926289] [2020-09-04 23:11:22,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:11:22,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:11:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:11:22,371 INFO L87 Difference]: Start difference. First operand 253 states and 281 transitions. Second operand 8 states. [2020-09-04 23:11:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:22,749 INFO L93 Difference]: Finished difference Result 521 states and 577 transitions. [2020-09-04 23:11:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:11:22,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2020-09-04 23:11:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:22,753 INFO L225 Difference]: With dead ends: 521 [2020-09-04 23:11:22,753 INFO L226 Difference]: Without dead ends: 331 [2020-09-04 23:11:22,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:11:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-09-04 23:11:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 264. [2020-09-04 23:11:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-09-04 23:11:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 292 transitions. [2020-09-04 23:11:22,772 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 292 transitions. Word has length 78 [2020-09-04 23:11:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:22,773 INFO L479 AbstractCegarLoop]: Abstraction has 264 states and 292 transitions. [2020-09-04 23:11:22,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:11:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 292 transitions. [2020-09-04 23:11:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 23:11:22,775 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:22,775 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:22,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 23:11:22,775 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1446971750, now seen corresponding path program 1 times [2020-09-04 23:11:22,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:22,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188090805] [2020-09-04 23:11:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:22,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:22,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:11:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:11:22,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188090805] [2020-09-04 23:11:22,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:11:22,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:11:22,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894576365] [2020-09-04 23:11:22,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:11:22,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:22,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:11:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:11:22,899 INFO L87 Difference]: Start difference. First operand 264 states and 292 transitions. Second operand 10 states. [2020-09-04 23:11:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:23,473 INFO L93 Difference]: Finished difference Result 599 states and 665 transitions. [2020-09-04 23:11:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:11:23,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-09-04 23:11:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:23,479 INFO L225 Difference]: With dead ends: 599 [2020-09-04 23:11:23,479 INFO L226 Difference]: Without dead ends: 435 [2020-09-04 23:11:23,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-09-04 23:11:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-09-04 23:11:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 355. [2020-09-04 23:11:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-09-04 23:11:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 393 transitions. [2020-09-04 23:11:23,520 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 393 transitions. Word has length 79 [2020-09-04 23:11:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:23,521 INFO L479 AbstractCegarLoop]: Abstraction has 355 states and 393 transitions. [2020-09-04 23:11:23,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:11:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 393 transitions. [2020-09-04 23:11:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-04 23:11:23,523 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:23,524 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:23,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 23:11:23,524 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1140392269, now seen corresponding path program 2 times [2020-09-04 23:11:23,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:23,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349545388] [2020-09-04 23:11:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:23,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:23,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 23:11:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:11:23,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349545388] [2020-09-04 23:11:23,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:11:23,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:11:23,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575225744] [2020-09-04 23:11:23,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:11:23,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:11:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:11:23,751 INFO L87 Difference]: Start difference. First operand 355 states and 393 transitions. Second operand 12 states. [2020-09-04 23:11:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:24,546 INFO L93 Difference]: Finished difference Result 694 states and 770 transitions. [2020-09-04 23:11:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:11:24,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2020-09-04 23:11:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:24,551 INFO L225 Difference]: With dead ends: 694 [2020-09-04 23:11:24,551 INFO L226 Difference]: Without dead ends: 525 [2020-09-04 23:11:24,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:11:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-09-04 23:11:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 390. [2020-09-04 23:11:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-09-04 23:11:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 432 transitions. [2020-09-04 23:11:24,586 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 432 transitions. Word has length 82 [2020-09-04 23:11:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:24,587 INFO L479 AbstractCegarLoop]: Abstraction has 390 states and 432 transitions. [2020-09-04 23:11:24,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:11:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 432 transitions. [2020-09-04 23:11:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-04 23:11:24,589 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:24,589 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:24,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 23:11:24,590 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1836590973, now seen corresponding path program 2 times [2020-09-04 23:11:24,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:24,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2137491544] [2020-09-04 23:11:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:24,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:24,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:11:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:11:24,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2137491544] [2020-09-04 23:11:24,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:11:24,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 23:11:24,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445678524] [2020-09-04 23:11:24,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:11:24,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:24,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:11:24,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:11:24,786 INFO L87 Difference]: Start difference. First operand 390 states and 432 transitions. Second operand 14 states. [2020-09-04 23:11:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:25,975 INFO L93 Difference]: Finished difference Result 680 states and 754 transitions. [2020-09-04 23:11:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:11:25,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2020-09-04 23:11:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:25,979 INFO L225 Difference]: With dead ends: 680 [2020-09-04 23:11:25,979 INFO L226 Difference]: Without dead ends: 428 [2020-09-04 23:11:25,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2020-09-04 23:11:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-09-04 23:11:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 247. [2020-09-04 23:11:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-09-04 23:11:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 270 transitions. [2020-09-04 23:11:26,006 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 270 transitions. Word has length 85 [2020-09-04 23:11:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:26,007 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 270 transitions. [2020-09-04 23:11:26,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:11:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 270 transitions. [2020-09-04 23:11:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 23:11:26,008 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:26,009 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:26,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 23:11:26,009 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1723821108, now seen corresponding path program 2 times [2020-09-04 23:11:26,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:26,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [266182073] [2020-09-04 23:11:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:26,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:11:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:26,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 23:11:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:11:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-09-04 23:11:26,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [266182073] [2020-09-04 23:11:26,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:11:26,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 23:11:26,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146045107] [2020-09-04 23:11:26,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:11:26,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:11:26,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:11:26,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:11:26,093 INFO L87 Difference]: Start difference. First operand 247 states and 270 transitions. Second operand 6 states. [2020-09-04 23:11:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:11:26,424 INFO L93 Difference]: Finished difference Result 387 states and 425 transitions. [2020-09-04 23:11:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:11:26,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2020-09-04 23:11:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:11:26,428 INFO L225 Difference]: With dead ends: 387 [2020-09-04 23:11:26,428 INFO L226 Difference]: Without dead ends: 290 [2020-09-04 23:11:26,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:11:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-09-04 23:11:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 247. [2020-09-04 23:11:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-09-04 23:11:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 269 transitions. [2020-09-04 23:11:26,459 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 269 transitions. Word has length 90 [2020-09-04 23:11:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:11:26,460 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 269 transitions. [2020-09-04 23:11:26,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:11:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 269 transitions. [2020-09-04 23:11:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 23:11:26,462 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:11:26,463 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:11:26,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 23:11:26,463 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:11:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:11:26,464 INFO L82 PathProgramCache]: Analyzing trace with hash 888855281, now seen corresponding path program 1 times [2020-09-04 23:11:26,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:11:26,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [566531849] [2020-09-04 23:11:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:11:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:11:26,501 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:11:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:11:26,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:11:26,607 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 23:11:26,607 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 23:11:26,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 23:11:26,689 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,705 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,706 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,707 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,707 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,707 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,713 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,714 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,714 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,715 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,715 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,716 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,716 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,716 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,720 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,720 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,721 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,721 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,722 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,723 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,723 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,723 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,724 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,725 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2020-09-04 23:11:26,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:11:26 BoogieIcfgContainer [2020-09-04 23:11:26,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:11:26,756 INFO L168 Benchmark]: Toolchain (without parser) took 14894.61 ms. Allocated memory was 145.2 MB in the beginning and 396.4 MB in the end (delta: 251.1 MB). Free memory was 101.7 MB in the beginning and 185.3 MB in the end (delta: -83.6 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:11:26,757 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 145.2 MB. Free memory was 120.8 MB in the beginning and 120.3 MB in the end (delta: 420.0 kB). Peak memory consumption was 420.0 kB. Max. memory is 7.1 GB. [2020-09-04 23:11:26,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.01 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 178.2 MB in the end (delta: -77.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2020-09-04 23:11:26,758 INFO L168 Benchmark]: Boogie Preprocessor took 65.48 ms. Allocated memory is still 201.9 MB. Free memory was 178.2 MB in the beginning and 175.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:11:26,759 INFO L168 Benchmark]: RCFGBuilder took 638.87 ms. Allocated memory is still 201.9 MB. Free memory was 175.4 MB in the beginning and 143.1 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2020-09-04 23:11:26,762 INFO L168 Benchmark]: TraceAbstraction took 13651.09 ms. Allocated memory was 201.9 MB in the beginning and 396.4 MB in the end (delta: 194.5 MB). Free memory was 142.1 MB in the beginning and 185.3 MB in the end (delta: -43.1 MB). Peak memory consumption was 151.4 MB. Max. memory is 7.1 GB. [2020-09-04 23:11:26,765 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.32 ms. Allocated memory is still 145.2 MB. Free memory was 120.8 MB in the beginning and 120.3 MB in the end (delta: 420.0 kB). Peak memory consumption was 420.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 533.01 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 178.2 MB in the end (delta: -77.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.48 ms. Allocated memory is still 201.9 MB. Free memory was 178.2 MB in the beginning and 175.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 638.87 ms. Allocated memory is still 201.9 MB. Free memory was 175.4 MB in the beginning and 143.1 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13651.09 ms. Allocated memory was 201.9 MB in the beginning and 396.4 MB in the end (delta: 194.5 MB). Free memory was 142.1 MB in the beginning and 185.3 MB in the end (delta: -43.1 MB). Peak memory consumption was 151.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] char A [2 + 2 + 4 +1]; VAL [A={4:0}] [L75] A[2 + 2 + 4] = 0 VAL [A={4:0}] [L76] CALL parse_expression_list (A) VAL [str={4:0}] [L48] int start=0, i=-1, j=-1; VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}] [L49] char str2[2]; VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L50] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L52] i++ VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L53] str[i] VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L54] case 0: VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L69] EXPR str[i] VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L69] COND TRUE str[i] != 0 VAL [i=0, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=40] [L52] i++ VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L53] str[i] VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=37] [L54] case 0: VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=37] [L69] EXPR str[i] VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=37] [L69] COND TRUE str[i] != 0 VAL [i=1, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=37] [L52] i++ VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}] [L53] str[i] VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L54] case 0: VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L55] EXPR str[start] VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L55] EXPR str[start] VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40, str[start]=40] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40, str[start]=40] [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40, str[start]=40] [L56] EXPR str[start] VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L56] COND FALSE !(str[start] == '"') VAL [i=2, j=-1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[start]=40] [L57] j = i-1 VAL [i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L58] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37] [L58] EXPR str[j] VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37, str[j]=37] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37, str[j]=37] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37, str[j]=37] [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37, str[j]=37] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L59] EXPR str[j] VAL [(0 < j) && (str[j] == '"')=1, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37] [L59] COND FALSE !((0 < j) && (str[j] == '"')) VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0, str[j]=37] [L60] COND TRUE start<=j VAL [i=2, j=1, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L61] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={3:0}, src={4:0}] [L30] return strncpy(dest,src,n); VAL [\old(n)=2, \result={36:38}, dest={3:0}, dest={3:0}, n=2, src={4:0}, src={4:0}, strncpy(dest,src,n)={36:38}] [L61] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={36:38}, start=0, str={4:0}, str={4:0}, str2={3:0}, str[i]=0] [L62] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.4s, OverallIterations: 20, TraceHistogramMax: 3, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2560 SDtfs, 3565 SDslu, 9431 SDs, 0 SdLazy, 6214 SolverSat, 277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 1535 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1464 NumberOfCodeBlocks, 1464 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 257869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 60/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...