/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:30:52,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:30:52,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:30:52,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:30:52,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:30:52,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:30:52,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:30:52,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:30:52,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:30:52,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:30:52,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:30:52,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:30:52,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:30:52,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:30:52,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:30:52,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:30:52,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:30:52,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:30:52,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:30:52,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:30:52,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:30:52,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:30:52,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:30:52,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:30:52,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:30:52,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:30:52,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:30:52,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:30:52,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:30:52,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:30:52,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:30:52,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:30:52,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:30:52,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:30:52,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:30:52,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:30:52,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:30:52,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:30:52,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:30:52,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:30:52,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:30:52,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:30:52,419 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:30:52,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:30:52,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:30:52,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:30:52,421 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:30:52,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:30:52,421 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:30:52,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:30:52,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:30:52,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:30:52,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:30:52,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:30:52,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:30:52,423 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:30:52,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:30:52,423 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:30:52,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:30:52,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:30:52,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:30:52,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:30:52,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:30:52,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:30:52,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:30:52,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:30:52,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:30:52,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:30:52,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:30:52,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:30:52,426 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:30:52,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:30:52,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:30:52,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:30:52,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:30:52,893 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:30:52,893 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:30:52,894 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-09-04 13:30:52,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d0256cdd3/7777a0d938f647d5bb941c7736704697/FLAG16dc2167a [2020-09-04 13:30:53,596 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:30:53,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-09-04 13:30:53,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d0256cdd3/7777a0d938f647d5bb941c7736704697/FLAG16dc2167a [2020-09-04 13:30:53,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d0256cdd3/7777a0d938f647d5bb941c7736704697 [2020-09-04 13:30:53,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:30:53,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:30:53,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:30:53,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:30:53,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:30:53,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:30:53" (1/1) ... [2020-09-04 13:30:53,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f931735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:53, skipping insertion in model container [2020-09-04 13:30:53,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:30:53" (1/1) ... [2020-09-04 13:30:53,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:30:53,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:30:54,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:30:54,388 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:30:54,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:30:54,524 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:30:54,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54 WrapperNode [2020-09-04 13:30:54,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:30:54,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:30:54,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:30:54,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:30:54,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (1/1) ... [2020-09-04 13:30:54,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (1/1) ... [2020-09-04 13:30:54,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (1/1) ... [2020-09-04 13:30:54,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (1/1) ... [2020-09-04 13:30:54,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (1/1) ... [2020-09-04 13:30:54,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (1/1) ... [2020-09-04 13:30:54,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (1/1) ... [2020-09-04 13:30:54,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:30:54,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:30:54,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:30:54,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:30:54,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (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 13:30:54,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:30:54,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:30:54,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:30:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-09-04 13:30:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-09-04 13:30:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-09-04 13:30:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-09-04 13:30:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-09-04 13:30:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-09-04 13:30:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-09-04 13:30:54,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-09-04 13:30:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-09-04 13:30:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-09-04 13:30:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-09-04 13:30:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-09-04 13:30:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-09-04 13:30:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-09-04 13:30:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-09-04 13:30:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-09-04 13:30:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-09-04 13:30:54,700 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-09-04 13:30:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-09-04 13:30:54,702 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-09-04 13:30:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 13:30:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 13:30:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 13:30:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 13:30:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 13:30:54,703 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-09-04 13:30:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 13:30:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-09-04 13:30:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-09-04 13:30:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:30:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-09-04 13:30:54,704 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-09-04 13:30:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-09-04 13:30:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 13:30:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-09-04 13:30:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-09-04 13:30:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-09-04 13:30:54,705 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-09-04 13:30:54,706 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-09-04 13:30:54,706 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-09-04 13:30:54,706 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-09-04 13:30:54,706 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-09-04 13:30:54,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-09-04 13:30:54,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-09-04 13:30:54,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-09-04 13:30:54,707 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-09-04 13:30:54,707 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-09-04 13:30:54,707 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-09-04 13:30:54,707 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-09-04 13:30:54,707 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-09-04 13:30:54,708 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-09-04 13:30:54,708 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-09-04 13:30:54,708 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-09-04 13:30:54,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-09-04 13:30:54,708 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-09-04 13:30:54,708 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-09-04 13:30:54,708 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-09-04 13:30:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-09-04 13:30:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-09-04 13:30:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-09-04 13:30:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-09-04 13:30:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-09-04 13:30:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-09-04 13:30:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-09-04 13:30:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-09-04 13:30:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-09-04 13:30:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-09-04 13:30:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-09-04 13:30:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-09-04 13:30:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-09-04 13:30:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-09-04 13:30:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-09-04 13:30:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-09-04 13:30:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:30:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:30:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:30:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 13:30:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 13:30:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 13:30:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 13:30:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:30:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:30:55,442 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:30:55,442 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-09-04 13:30:55,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:30:55 BoogieIcfgContainer [2020-09-04 13:30:55,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:30:55,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:30:55,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:30:55,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:30:55,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:30:53" (1/3) ... [2020-09-04 13:30:55,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6fbf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:30:55, skipping insertion in model container [2020-09-04 13:30:55,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:30:54" (2/3) ... [2020-09-04 13:30:55,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6fbf1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:30:55, skipping insertion in model container [2020-09-04 13:30:55,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:30:55" (3/3) ... [2020-09-04 13:30:55,459 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-09-04 13:30:55,471 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:30:55,482 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-09-04 13:30:55,503 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-09-04 13:30:55,537 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:30:55,538 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:30:55,538 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:30:55,538 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:30:55,538 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:30:55,538 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:30:55,539 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:30:55,539 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:30:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-09-04 13:30:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-09-04 13:30:55,575 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:55,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:30:55,577 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash 11193106, now seen corresponding path program 1 times [2020-09-04 13:30:55,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:55,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212976579] [2020-09-04 13:30:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:55,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:55,848 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 13:30:55,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212976579] [2020-09-04 13:30:55,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:55,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:30:55,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592601749] [2020-09-04 13:30:55,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:30:55,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:30:55,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:55,882 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2020-09-04 13:30:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:56,174 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2020-09-04 13:30:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:30:56,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-09-04 13:30:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:56,192 INFO L225 Difference]: With dead ends: 188 [2020-09-04 13:30:56,192 INFO L226 Difference]: Without dead ends: 100 [2020-09-04 13:30:56,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-04 13:30:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2020-09-04 13:30:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-09-04 13:30:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2020-09-04 13:30:56,264 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2020-09-04 13:30:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:56,264 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2020-09-04 13:30:56,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:30:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-09-04 13:30:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:30:56,265 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:56,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:30:56,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:30:56,266 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:56,267 INFO L82 PathProgramCache]: Analyzing trace with hash -648207140, now seen corresponding path program 1 times [2020-09-04 13:30:56,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:56,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105841739] [2020-09-04 13:30:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:56,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:56,376 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 13:30:56,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105841739] [2020-09-04 13:30:56,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:56,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:30:56,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114795932] [2020-09-04 13:30:56,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:30:56,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:56,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:30:56,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:56,383 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2020-09-04 13:30:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:56,570 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2020-09-04 13:30:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:30:56,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-09-04 13:30:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:56,573 INFO L225 Difference]: With dead ends: 85 [2020-09-04 13:30:56,573 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 13:30:56,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 13:30:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 13:30:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 13:30:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2020-09-04 13:30:56,588 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2020-09-04 13:30:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:56,588 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2020-09-04 13:30:56,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:30:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2020-09-04 13:30:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:30:56,589 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:56,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:30:56,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:30:56,590 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash -648205218, now seen corresponding path program 1 times [2020-09-04 13:30:56,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:56,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871997834] [2020-09-04 13:30:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:56,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:56,666 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 13:30:56,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871997834] [2020-09-04 13:30:56,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:56,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:30:56,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836777995] [2020-09-04 13:30:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:30:56,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:30:56,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:30:56,669 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2020-09-04 13:30:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:56,901 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2020-09-04 13:30:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:30:56,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:30:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:56,903 INFO L225 Difference]: With dead ends: 140 [2020-09-04 13:30:56,903 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 13:30:56,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:30:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 13:30:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-09-04 13:30:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 13:30:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2020-09-04 13:30:56,914 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 14 [2020-09-04 13:30:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:56,915 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2020-09-04 13:30:56,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:30:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2020-09-04 13:30:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:30:56,916 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:56,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:30:56,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:30:56,916 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:56,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash -646358176, now seen corresponding path program 1 times [2020-09-04 13:30:56,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:56,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399160267] [2020-09-04 13:30:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:56,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:57,010 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 13:30:57,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399160267] [2020-09-04 13:30:57,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:57,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:30:57,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918835952] [2020-09-04 13:30:57,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:30:57,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:57,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:30:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:30:57,013 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 5 states. [2020-09-04 13:30:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:57,182 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2020-09-04 13:30:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:30:57,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:30:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:57,184 INFO L225 Difference]: With dead ends: 85 [2020-09-04 13:30:57,184 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 13:30:57,184 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:30:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 13:30:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-09-04 13:30:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 13:30:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2020-09-04 13:30:57,193 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2020-09-04 13:30:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:57,193 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2020-09-04 13:30:57,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:30:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2020-09-04 13:30:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:30:57,195 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:57,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:30:57,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:30:57,195 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1093009051, now seen corresponding path program 1 times [2020-09-04 13:30:57,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:57,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748791120] [2020-09-04 13:30:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:57,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:57,276 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 13:30:57,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748791120] [2020-09-04 13:30:57,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:57,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:30:57,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20238805] [2020-09-04 13:30:57,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:30:57,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:30:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:57,279 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 4 states. [2020-09-04 13:30:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:57,464 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2020-09-04 13:30:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:30:57,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-09-04 13:30:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:57,466 INFO L225 Difference]: With dead ends: 83 [2020-09-04 13:30:57,466 INFO L226 Difference]: Without dead ends: 79 [2020-09-04 13:30:57,467 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-04 13:30:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2020-09-04 13:30:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 13:30:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2020-09-04 13:30:57,474 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2020-09-04 13:30:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:57,474 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2020-09-04 13:30:57,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:30:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-09-04 13:30:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:30:57,475 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:57,476 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] [2020-09-04 13:30:57,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:30:57,476 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash -476453587, now seen corresponding path program 1 times [2020-09-04 13:30:57,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:57,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499911773] [2020-09-04 13:30:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:57,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:57,544 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 13:30:57,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499911773] [2020-09-04 13:30:57,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:57,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:30:57,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240320757] [2020-09-04 13:30:57,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:30:57,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:57,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:30:57,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:30:57,547 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 6 states. [2020-09-04 13:30:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:57,749 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2020-09-04 13:30:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:30:57,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-09-04 13:30:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:57,751 INFO L225 Difference]: With dead ends: 136 [2020-09-04 13:30:57,751 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 13:30:57,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:30:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 13:30:57,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-09-04 13:30:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 13:30:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-09-04 13:30:57,766 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2020-09-04 13:30:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:57,766 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-09-04 13:30:57,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:30:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-09-04 13:30:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:30:57,767 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:57,767 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] [2020-09-04 13:30:57,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:30:57,768 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash 337242584, now seen corresponding path program 1 times [2020-09-04 13:30:57,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:57,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611056802] [2020-09-04 13:30:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:57,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:57,822 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 13:30:57,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611056802] [2020-09-04 13:30:57,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:57,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:30:57,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205839623] [2020-09-04 13:30:57,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:30:57,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:30:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:57,825 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2020-09-04 13:30:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:57,979 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2020-09-04 13:30:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:30:57,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-09-04 13:30:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:57,981 INFO L225 Difference]: With dead ends: 141 [2020-09-04 13:30:57,981 INFO L226 Difference]: Without dead ends: 99 [2020-09-04 13:30:57,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-09-04 13:30:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2020-09-04 13:30:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 13:30:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2020-09-04 13:30:57,989 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2020-09-04 13:30:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:57,990 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-09-04 13:30:57,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:30:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2020-09-04 13:30:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:30:57,991 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:57,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:30:57,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:30:57,992 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:57,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1864575058, now seen corresponding path program 1 times [2020-09-04 13:30:57,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:57,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383869476] [2020-09-04 13:30:57,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,047 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 13:30:58,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383869476] [2020-09-04 13:30:58,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:58,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:30:58,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483969135] [2020-09-04 13:30:58,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:30:58,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:58,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:30:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:58,049 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 4 states. [2020-09-04 13:30:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:58,169 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2020-09-04 13:30:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:30:58,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-09-04 13:30:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:58,170 INFO L225 Difference]: With dead ends: 78 [2020-09-04 13:30:58,170 INFO L226 Difference]: Without dead ends: 76 [2020-09-04 13:30:58,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:30:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-09-04 13:30:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-09-04 13:30:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 13:30:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-09-04 13:30:58,177 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2020-09-04 13:30:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:58,177 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-09-04 13:30:58,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:30:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-09-04 13:30:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:30:58,179 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:58,179 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] [2020-09-04 13:30:58,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:30:58,179 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash -660297045, now seen corresponding path program 1 times [2020-09-04 13:30:58,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:58,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992340364] [2020-09-04 13:30:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,239 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 13:30:58,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992340364] [2020-09-04 13:30:58,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:58,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:30:58,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956469648] [2020-09-04 13:30:58,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:30:58,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:58,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:30:58,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:30:58,241 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 5 states. [2020-09-04 13:30:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:58,496 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2020-09-04 13:30:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:30:58,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-09-04 13:30:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:58,498 INFO L225 Difference]: With dead ends: 194 [2020-09-04 13:30:58,498 INFO L226 Difference]: Without dead ends: 130 [2020-09-04 13:30:58,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:30:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-09-04 13:30:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2020-09-04 13:30:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 13:30:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2020-09-04 13:30:58,515 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 27 [2020-09-04 13:30:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:58,516 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-09-04 13:30:58,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:30:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2020-09-04 13:30:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:30:58,517 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:58,517 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] [2020-09-04 13:30:58,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:30:58,520 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:58,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1681365399, now seen corresponding path program 1 times [2020-09-04 13:30:58,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:58,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006587387] [2020-09-04 13:30:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,618 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 13:30:58,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006587387] [2020-09-04 13:30:58,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:58,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:30:58,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475599981] [2020-09-04 13:30:58,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:30:58,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:30:58,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:30:58,621 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 5 states. [2020-09-04 13:30:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:58,768 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2020-09-04 13:30:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:30:58,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-09-04 13:30:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:58,773 INFO L225 Difference]: With dead ends: 79 [2020-09-04 13:30:58,773 INFO L226 Difference]: Without dead ends: 77 [2020-09-04 13:30:58,774 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:30:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-09-04 13:30:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-09-04 13:30:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 13:30:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-09-04 13:30:58,780 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 27 [2020-09-04 13:30:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:58,780 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-09-04 13:30:58,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:30:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-09-04 13:30:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:30:58,781 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:58,782 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] [2020-09-04 13:30:58,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:30:58,782 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash -840739825, now seen corresponding path program 1 times [2020-09-04 13:30:58,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:58,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535609932] [2020-09-04 13:30:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:58,896 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 13:30:58,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535609932] [2020-09-04 13:30:58,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:58,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:30:58,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78041001] [2020-09-04 13:30:58,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:30:58,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:30:58,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:30:58,901 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2020-09-04 13:30:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:30:59,242 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2020-09-04 13:30:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:30:59,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-09-04 13:30:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:30:59,244 INFO L225 Difference]: With dead ends: 182 [2020-09-04 13:30:59,244 INFO L226 Difference]: Without dead ends: 139 [2020-09-04 13:30:59,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:30:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-09-04 13:30:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2020-09-04 13:30:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-04 13:30:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2020-09-04 13:30:59,257 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2020-09-04 13:30:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:30:59,260 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2020-09-04 13:30:59,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:30:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2020-09-04 13:30:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:30:59,265 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:30:59,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] [2020-09-04 13:30:59,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:30:59,267 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:30:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:30:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash -941335665, now seen corresponding path program 1 times [2020-09-04 13:30:59,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:30:59,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357897410] [2020-09-04 13:30:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:30:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:59,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:30:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:30:59,598 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 13:30:59,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357897410] [2020-09-04 13:30:59,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:30:59,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:30:59,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003843626] [2020-09-04 13:30:59,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:30:59,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:30:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:30:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:30:59,600 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 8 states. [2020-09-04 13:31:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:00,295 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2020-09-04 13:31:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:31:00,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-09-04 13:31:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:00,299 INFO L225 Difference]: With dead ends: 237 [2020-09-04 13:31:00,299 INFO L226 Difference]: Without dead ends: 235 [2020-09-04 13:31:00,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:31:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-09-04 13:31:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 98. [2020-09-04 13:31:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 13:31:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-09-04 13:31:00,309 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2020-09-04 13:31:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:00,310 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-09-04 13:31:00,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:31:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2020-09-04 13:31:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:31:00,311 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:00,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:00,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:31:00,312 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1932526751, now seen corresponding path program 1 times [2020-09-04 13:31:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:00,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409617673] [2020-09-04 13:31:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:00,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:00,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409617673] [2020-09-04 13:31:00,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:00,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:31:00,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045740209] [2020-09-04 13:31:00,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:31:00,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:00,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:31:00,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:31:00,398 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2020-09-04 13:31:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:00,617 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2020-09-04 13:31:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:31:00,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-09-04 13:31:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:00,619 INFO L225 Difference]: With dead ends: 145 [2020-09-04 13:31:00,619 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 13:31:00,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:31:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 13:31:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-09-04 13:31:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-04 13:31:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-09-04 13:31:00,628 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2020-09-04 13:31:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:00,628 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-09-04 13:31:00,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:31:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-09-04 13:31:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:31:00,633 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:00,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:00,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:31:00,633 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash -250794977, now seen corresponding path program 1 times [2020-09-04 13:31:00,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:00,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435146447] [2020-09-04 13:31:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:00,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:00,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435146447] [2020-09-04 13:31:00,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:00,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:31:00,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14379261] [2020-09-04 13:31:00,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:31:00,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:31:00,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:00,701 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 4 states. [2020-09-04 13:31:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:00,864 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2020-09-04 13:31:00,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:31:00,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-09-04 13:31:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:00,866 INFO L225 Difference]: With dead ends: 119 [2020-09-04 13:31:00,866 INFO L226 Difference]: Without dead ends: 117 [2020-09-04 13:31:00,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-09-04 13:31:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-09-04 13:31:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-09-04 13:31:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2020-09-04 13:31:00,875 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2020-09-04 13:31:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:00,875 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2020-09-04 13:31:00,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:31:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2020-09-04 13:31:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:31:00,876 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:00,876 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] [2020-09-04 13:31:00,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:31:00,877 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1485208190, now seen corresponding path program 1 times [2020-09-04 13:31:00,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:00,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028134652] [2020-09-04 13:31:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:01,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:01,110 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 13:31:01,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028134652] [2020-09-04 13:31:01,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:01,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:31:01,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189688234] [2020-09-04 13:31:01,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:31:01,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:01,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:31:01,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:31:01,112 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 8 states. [2020-09-04 13:31:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:01,758 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2020-09-04 13:31:01,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:31:01,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-09-04 13:31:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:01,761 INFO L225 Difference]: With dead ends: 240 [2020-09-04 13:31:01,761 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 13:31:01,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:31:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 13:31:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 120. [2020-09-04 13:31:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-04 13:31:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2020-09-04 13:31:01,771 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2020-09-04 13:31:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:01,772 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2020-09-04 13:31:01,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:31:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2020-09-04 13:31:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 13:31:01,773 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:01,773 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:01,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:31:01,774 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1679328926, now seen corresponding path program 1 times [2020-09-04 13:31:01,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:01,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001735645] [2020-09-04 13:31:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:01,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:01,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001735645] [2020-09-04 13:31:01,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403092844] [2020-09-04 13:31:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:01,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2020-09-04 13:31:01,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:02,109 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:02,110 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:02,125 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:02,125 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:02,135 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-09-04 13:31:02,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:02,176 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-09-04 13:31:02,178 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:02,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:02,195 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-09-04 13:31:02,196 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:02,207 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,207 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-09-04 13:31:02,286 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-09-04 13:31:02,288 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:02,300 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:02,300 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2020-09-04 13:31:02,302 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:02,307 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:02,307 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2020-09-04 13:31:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:02,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:02,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-09-04 13:31:02,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166436402] [2020-09-04 13:31:02,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:31:02,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:31:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:31:02,315 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 9 states. [2020-09-04 13:31:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:02,799 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2020-09-04 13:31:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:31:02,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-09-04 13:31:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:02,801 INFO L225 Difference]: With dead ends: 208 [2020-09-04 13:31:02,801 INFO L226 Difference]: Without dead ends: 146 [2020-09-04 13:31:02,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:31:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-09-04 13:31:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2020-09-04 13:31:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-09-04 13:31:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2020-09-04 13:31:02,827 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2020-09-04 13:31:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:02,827 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-09-04 13:31:02,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:31:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2020-09-04 13:31:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 13:31:02,830 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:02,830 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] [2020-09-04 13:31:03,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-09-04 13:31:03,044 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1814124928, now seen corresponding path program 1 times [2020-09-04 13:31:03,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:03,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456820088] [2020-09-04 13:31:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:03,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:03,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456820088] [2020-09-04 13:31:03,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:03,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:31:03,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976768356] [2020-09-04 13:31:03,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:31:03,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:31:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:31:03,154 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 7 states. [2020-09-04 13:31:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:03,477 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2020-09-04 13:31:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:31:03,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 13:31:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:03,479 INFO L225 Difference]: With dead ends: 198 [2020-09-04 13:31:03,479 INFO L226 Difference]: Without dead ends: 178 [2020-09-04 13:31:03,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:31:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-09-04 13:31:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2020-09-04 13:31:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-09-04 13:31:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2020-09-04 13:31:03,491 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 33 [2020-09-04 13:31:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:03,491 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2020-09-04 13:31:03,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:31:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2020-09-04 13:31:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 13:31:03,493 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:03,493 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] [2020-09-04 13:31:03,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:31:03,494 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:03,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2032979646, now seen corresponding path program 1 times [2020-09-04 13:31:03,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:03,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697345653] [2020-09-04 13:31:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:03,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:03,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697345653] [2020-09-04 13:31:03,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:03,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:31:03,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214997029] [2020-09-04 13:31:03,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:31:03,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:31:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:31:03,584 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand 6 states. [2020-09-04 13:31:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:03,818 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2020-09-04 13:31:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:31:03,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-09-04 13:31:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:03,820 INFO L225 Difference]: With dead ends: 182 [2020-09-04 13:31:03,820 INFO L226 Difference]: Without dead ends: 166 [2020-09-04 13:31:03,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 13:31:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-09-04 13:31:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2020-09-04 13:31:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-09-04 13:31:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2020-09-04 13:31:03,844 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 33 [2020-09-04 13:31:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:03,844 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2020-09-04 13:31:03,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:31:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2020-09-04 13:31:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 13:31:03,845 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:03,845 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:03,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:31:03,846 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash 270360779, now seen corresponding path program 1 times [2020-09-04 13:31:03,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:03,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396788046] [2020-09-04 13:31:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:03,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:03,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396788046] [2020-09-04 13:31:03,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41659580] [2020-09-04 13:31:03,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:04,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2020-09-04 13:31:04,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:04,027 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:04,027 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:04,038 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-09-04 13:31:04,039 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:04,045 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,045 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-09-04 13:31:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:04,064 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-09-04 13:31:04,065 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:04,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:04,083 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-09-04 13:31:04,084 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:04,093 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,093 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-09-04 13:31:04,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:04,171 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-09-04 13:31:04,172 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:04,184 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-09-04 13:31:04,185 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2020-09-04 13:31:04,186 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:04,193 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:04,193 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-09-04 13:31:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:04,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:04,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-09-04 13:31:04,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736809379] [2020-09-04 13:31:04,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:31:04,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:31:04,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:31:04,207 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand 8 states. [2020-09-04 13:31:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:04,689 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2020-09-04 13:31:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:31:04,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-09-04 13:31:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:04,691 INFO L225 Difference]: With dead ends: 248 [2020-09-04 13:31:04,691 INFO L226 Difference]: Without dead ends: 210 [2020-09-04 13:31:04,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:31:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-09-04 13:31:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 169. [2020-09-04 13:31:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-09-04 13:31:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2020-09-04 13:31:04,703 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 36 [2020-09-04 13:31:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:04,703 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2020-09-04 13:31:04,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:31:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2020-09-04 13:31:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 13:31:04,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:04,705 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] [2020-09-04 13:31:04,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:04,920 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash -620993698, now seen corresponding path program 1 times [2020-09-04 13:31:04,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:04,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230904367] [2020-09-04 13:31:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:04,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:04,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230904367] [2020-09-04 13:31:04,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:04,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:31:04,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474624964] [2020-09-04 13:31:04,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:31:04,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:04,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:31:04,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:04,973 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 4 states. [2020-09-04 13:31:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:05,136 INFO L93 Difference]: Finished difference Result 354 states and 437 transitions. [2020-09-04 13:31:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:31:05,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-09-04 13:31:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:05,138 INFO L225 Difference]: With dead ends: 354 [2020-09-04 13:31:05,138 INFO L226 Difference]: Without dead ends: 258 [2020-09-04 13:31:05,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-09-04 13:31:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2020-09-04 13:31:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-09-04 13:31:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2020-09-04 13:31:05,153 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2020-09-04 13:31:05,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:05,153 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2020-09-04 13:31:05,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:31:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2020-09-04 13:31:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 13:31:05,154 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:05,154 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:31:05,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:31:05,155 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash -366933706, now seen corresponding path program 1 times [2020-09-04 13:31:05,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:05,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576605543] [2020-09-04 13:31:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:05,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:05,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576605543] [2020-09-04 13:31:05,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795875031] [2020-09-04 13:31:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:05,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2020-09-04 13:31:05,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:05,548 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-09-04 13:31:05,549 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,555 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,555 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-09-04 13:31:05,568 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-09-04 13:31:05,568 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,585 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-09-04 13:31:05,586 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,601 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,601 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2020-09-04 13:31:05,668 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,669 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-09-04 13:31:05,670 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:05,701 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2020-09-04 13:31:05,702 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:05,727 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2020-09-04 13:31:05,728 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,752 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:05,753 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:89, output treesize:50 [2020-09-04 13:31:05,824 INFO L441 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_40|], 12=[|v_#memory_$Pointer$.base_40|]} [2020-09-04 13:31:05,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:05,830 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2020-09-04 13:31:05,831 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,853 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:05,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:05,939 INFO L350 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2020-09-04 13:31:05,939 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2020-09-04 13:31:05,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-09-04 13:31:05,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:31:05,947 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:05,994 INFO L625 ElimStorePlain]: treesize reduction 64, result has 55.9 percent of original size [2020-09-04 13:31:05,996 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:05,996 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:81 [2020-09-04 13:31:08,197 INFO L441 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2020-09-04 13:31:08,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:08,205 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2020-09-04 13:31:08,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:08,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:08,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:08,294 INFO L350 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2020-09-04 13:31:08,294 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2020-09-04 13:31:08,297 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-09-04 13:31:08,298 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:31:08,299 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:08,300 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-04 13:31:08,309 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:08,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:08,318 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:08,319 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:88, output treesize:7 [2020-09-04 13:31:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:08,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:31:08,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-09-04 13:31:08,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048625216] [2020-09-04 13:31:08,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:31:08,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:31:08,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2020-09-04 13:31:08,339 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2020-09-04 13:31:20,553 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2020-09-04 13:31:23,413 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2020-09-04 13:31:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:24,098 INFO L93 Difference]: Finished difference Result 521 states and 619 transitions. [2020-09-04 13:31:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:31:24,098 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-09-04 13:31:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:24,101 INFO L225 Difference]: With dead ends: 521 [2020-09-04 13:31:24,101 INFO L226 Difference]: Without dead ends: 429 [2020-09-04 13:31:24,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=221, Invalid=708, Unknown=1, NotChecked=0, Total=930 [2020-09-04 13:31:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-09-04 13:31:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 247. [2020-09-04 13:31:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-09-04 13:31:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 297 transitions. [2020-09-04 13:31:24,120 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 297 transitions. Word has length 40 [2020-09-04 13:31:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:24,121 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 297 transitions. [2020-09-04 13:31:24,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:31:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 297 transitions. [2020-09-04 13:31:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 13:31:24,122 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:24,122 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 13:31:24,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:24,331 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1717014481, now seen corresponding path program 1 times [2020-09-04 13:31:24,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:24,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489826677] [2020-09-04 13:31:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:31:24,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:31:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:31:24,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:31:24,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:31:24,426 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:31:24,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 13:31:24,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:31:24 BoogieIcfgContainer [2020-09-04 13:31:24,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:31:24,522 INFO L168 Benchmark]: Toolchain (without parser) took 30696.29 ms. Allocated memory was 140.0 MB in the beginning and 344.5 MB in the end (delta: 204.5 MB). Free memory was 102.6 MB in the beginning and 199.0 MB in the end (delta: -96.4 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:24,522 INFO L168 Benchmark]: CDTParser took 1.11 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 13:31:24,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.62 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 170.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:24,523 INFO L168 Benchmark]: Boogie Preprocessor took 83.46 ms. Allocated memory is still 203.9 MB. Free memory was 170.2 MB in the beginning and 167.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:24,523 INFO L168 Benchmark]: RCFGBuilder took 838.75 ms. Allocated memory is still 203.9 MB. Free memory was 166.8 MB in the beginning and 111.4 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:24,525 INFO L168 Benchmark]: TraceAbstraction took 29069.96 ms. Allocated memory was 203.9 MB in the beginning and 344.5 MB in the end (delta: 140.5 MB). Free memory was 110.8 MB in the beginning and 199.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:31:24,530 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 698.62 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 170.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.46 ms. Allocated memory is still 203.9 MB. Free memory was 170.2 MB in the beginning and 167.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.75 ms. Allocated memory is still 203.9 MB. Free memory was 166.8 MB in the beginning and 111.4 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29069.96 ms. Allocated memory was 203.9 MB in the beginning and 344.5 MB in the end (delta: 140.5 MB). Free memory was 110.8 MB in the beginning and 199.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={10:3}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={-1:0}, inner={10:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={10:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={10:3}, inner->inner={11:13}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={-1:0}, inner={10:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.8s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1634 SDtfs, 2167 SDslu, 3225 SDs, 0 SdLazy, 3713 SolverSat, 227 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 855 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 635 ConstructedInterpolants, 16 QuantifiedInterpolants, 228642 SizeOfPredicates, 31 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 10/19 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...