./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:17:26,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:17:26,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:17:26,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:17:26,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:17:26,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:17:26,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:17:26,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:17:26,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:17:26,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:17:26,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:17:26,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:17:26,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:17:26,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:17:26,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:17:26,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:17:26,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:17:26,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:17:26,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:17:26,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:17:26,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:17:26,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:17:26,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:17:26,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:17:26,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:17:26,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:17:26,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:17:26,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:17:26,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:17:26,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:17:26,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:17:26,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:17:26,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:17:26,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:17:26,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:17:26,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:17:26,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:17:26,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:17:26,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:17:26,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:17:26,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:17:26,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:17:26,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:17:26,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:17:26,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:17:26,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:17:26,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:17:26,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:17:26,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:17:26,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:17:26,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:17:26,801 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:17:26,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:17:26,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:17:26,802 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:17:26,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:17:26,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:17:26,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:17:26,803 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:17:26,803 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:17:26,803 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:17:26,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:17:26,804 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:17:26,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:17:26,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:17:26,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:17:26,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:17:26,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:17:26,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:17:26,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:17:26,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:17:26,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:17:26,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:17:26,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-07-20 06:17:27,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:17:27,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:17:27,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:17:27,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:17:27,249 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:17:27,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-20 06:17:27,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25714d126/3fb7b72c13554aa584f4bcd2ee685593/FLAGb6bb3e4f6 [2022-07-20 06:17:28,066 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:17:28,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-20 06:17:28,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25714d126/3fb7b72c13554aa584f4bcd2ee685593/FLAGb6bb3e4f6 [2022-07-20 06:17:28,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25714d126/3fb7b72c13554aa584f4bcd2ee685593 [2022-07-20 06:17:28,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:17:28,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:17:28,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:17:28,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:17:28,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:17:28,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:28,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6165e0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28, skipping insertion in model container [2022-07-20 06:17:28,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:28,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:17:28,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:17:28,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-07-20 06:17:28,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:17:28,771 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:17:28,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-07-20 06:17:28,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:17:28,884 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:17:28,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28 WrapperNode [2022-07-20 06:17:28,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:17:28,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:17:28,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:17:28,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:17:28,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:28,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:28,991 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2022-07-20 06:17:28,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:17:28,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:17:28,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:17:28,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:17:28,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:28,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:29,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:29,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:29,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:29,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:29,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:29,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:17:29,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:17:29,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:17:29,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:17:29,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (1/1) ... [2022-07-20 06:17:29,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:17:29,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:29,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:17:29,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:17:29,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:17:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:17:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-20 06:17:29,173 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-20 06:17:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:17:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:17:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:17:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:17:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:17:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:17:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:17:29,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:17:29,356 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:17:29,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:17:29,804 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:17:29,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:17:29,816 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-20 06:17:29,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:17:29 BoogieIcfgContainer [2022-07-20 06:17:29,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:17:29,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:17:29,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:17:29,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:17:29,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:17:28" (1/3) ... [2022-07-20 06:17:29,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5d9f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:17:29, skipping insertion in model container [2022-07-20 06:17:29,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:17:28" (2/3) ... [2022-07-20 06:17:29,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5d9f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:17:29, skipping insertion in model container [2022-07-20 06:17:29,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:17:29" (3/3) ... [2022-07-20 06:17:29,837 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-07-20 06:17:29,848 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:17:29,863 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-07-20 06:17:29,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:17:29,946 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a45c66b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26403b4 [2022-07-20 06:17:29,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-07-20 06:17:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:17:29,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:29,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:17:29,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2022-07-20 06:17:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:30,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993354780] [2022-07-20 06:17:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:17:30,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:30,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993354780] [2022-07-20 06:17:30,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993354780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:30,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:30,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:17:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711828714] [2022-07-20 06:17:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:30,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:17:30,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:30,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:17:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:17:30,270 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:17:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:30,360 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-07-20 06:17:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:17:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 06:17:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:30,368 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:17:30,369 INFO L226 Difference]: Without dead ends: 87 [2022-07-20 06:17:30,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:17:30,373 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:30,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-20 06:17:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-20 06:17:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-20 06:17:30,409 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2022-07-20 06:17:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:30,409 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-20 06:17:30,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:17:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-20 06:17:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:17:30,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:30,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:17:30,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:17:30,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2022-07-20 06:17:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202663818] [2022-07-20 06:17:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:17:30,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:30,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202663818] [2022-07-20 06:17:30,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202663818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:30,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:30,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:17:30,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839705658] [2022-07-20 06:17:30,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:30,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:17:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:17:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:17:30,477 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:17:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:30,516 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-07-20 06:17:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:17:30,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 06:17:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:30,517 INFO L225 Difference]: With dead ends: 84 [2022-07-20 06:17:30,517 INFO L226 Difference]: Without dead ends: 84 [2022-07-20 06:17:30,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:17:30,518 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:30,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:17:30,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-20 06:17:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-20 06:17:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-07-20 06:17:30,524 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2022-07-20 06:17:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:30,525 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-07-20 06:17:30,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:17:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-07-20 06:17:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:17:30,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:30,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:30,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:17:30,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2022-07-20 06:17:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:30,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548196186] [2022-07-20 06:17:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:17:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:30,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548196186] [2022-07-20 06:17:30,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548196186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:30,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:30,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:17:30,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317426599] [2022-07-20 06:17:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:30,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:17:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:30,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:17:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:17:30,604 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:17:30,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:30,658 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-07-20 06:17:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:17:30,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-20 06:17:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:30,660 INFO L225 Difference]: With dead ends: 95 [2022-07-20 06:17:30,660 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 06:17:30,660 INFO L412 NwaCegarLoop]: 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 [2022-07-20 06:17:30,661 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:30,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:17:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 06:17:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-07-20 06:17:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-07-20 06:17:30,668 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2022-07-20 06:17:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:30,668 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-07-20 06:17:30,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 06:17:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-07-20 06:17:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:17:30,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:30,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:30,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:17:30,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2022-07-20 06:17:30,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:30,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971808049] [2022-07-20 06:17:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:17:30,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:30,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971808049] [2022-07-20 06:17:30,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971808049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:30,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:30,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:17:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113677477] [2022-07-20 06:17:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:30,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:17:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:17:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:17:30,772 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:30,889 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-07-20 06:17:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:30,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-20 06:17:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:30,892 INFO L225 Difference]: With dead ends: 105 [2022-07-20 06:17:30,892 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 06:17:30,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:30,893 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:30,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 06:17:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-07-20 06:17:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-07-20 06:17:30,898 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2022-07-20 06:17:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:30,898 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-07-20 06:17:30,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-07-20 06:17:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:17:30,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:30,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:30,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:17:30,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2022-07-20 06:17:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:30,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349125041] [2022-07-20 06:17:30,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:30,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:31,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:31,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349125041] [2022-07-20 06:17:31,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349125041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:31,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:31,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:17:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896364449] [2022-07-20 06:17:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:31,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:17:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:31,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:17:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:17:31,035 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:31,154 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-07-20 06:17:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-20 06:17:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:31,155 INFO L225 Difference]: With dead ends: 84 [2022-07-20 06:17:31,156 INFO L226 Difference]: Without dead ends: 84 [2022-07-20 06:17:31,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:31,157 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:31,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-20 06:17:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-07-20 06:17:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-07-20 06:17:31,161 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2022-07-20 06:17:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:31,161 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-07-20 06:17:31,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-07-20 06:17:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:17:31,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:31,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:31,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:17:31,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2022-07-20 06:17:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:31,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382807717] [2022-07-20 06:17:31,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:31,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:31,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382807717] [2022-07-20 06:17:31,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382807717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:31,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596322049] [2022-07-20 06:17:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:31,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:31,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:17:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:31,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:17:31,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:31,492 INFO L390 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 [2022-07-20 06:17:31,678 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:17:31,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:17:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:17:31,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:31,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596322049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:31,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:17:31,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-20 06:17:31,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986423188] [2022-07-20 06:17:31,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:31,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:17:31,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:31,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:17:31,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:17:31,745 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:31,904 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-07-20 06:17:31,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:31,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-07-20 06:17:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:31,907 INFO L225 Difference]: With dead ends: 110 [2022-07-20 06:17:31,907 INFO L226 Difference]: Without dead ends: 110 [2022-07-20 06:17:31,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:17:31,910 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:31,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-07-20 06:17:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-20 06:17:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2022-07-20 06:17:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-07-20 06:17:31,921 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2022-07-20 06:17:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:31,922 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-07-20 06:17:31,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-07-20 06:17:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:17:31,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:31,923 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:31,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 06:17:32,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-20 06:17:32,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2022-07-20 06:17:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:32,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305866368] [2022-07-20 06:17:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:32,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305866368] [2022-07-20 06:17:32,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305866368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389339395] [2022-07-20 06:17:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:32,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:32,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:17:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:32,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:17:32,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:32,495 INFO L390 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 [2022-07-20 06:17:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:17:32,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-07-20 06:17:32,703 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:17:32,703 INFO L390 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 11 [2022-07-20 06:17:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:17:32,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:32,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389339395] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:32,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:17:32,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-20 06:17:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989946492] [2022-07-20 06:17:32,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:32,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:17:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:17:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:17:32,824 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:17:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:33,191 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-07-20 06:17:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:17:33,191 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-07-20 06:17:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:33,192 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:17:33,192 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:17:33,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-07-20 06:17:33,193 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:33,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 2 Unchecked, 0.3s Time] [2022-07-20 06:17:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:17:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-07-20 06:17:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2022-07-20 06:17:33,196 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2022-07-20 06:17:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:33,196 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2022-07-20 06:17:33,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:17:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-07-20 06:17:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:17:33,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:33,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:33,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:33,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-20 06:17:33,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:33,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2022-07-20 06:17:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:33,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859301245] [2022-07-20 06:17:33,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:33,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859301245] [2022-07-20 06:17:33,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859301245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:33,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557758994] [2022-07-20 06:17:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:33,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:33,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:33,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:33,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:17:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:33,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 06:17:33,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:33,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:33,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557758994] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:17:33,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:17:33,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-07-20 06:17:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266914396] [2022-07-20 06:17:33,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:33,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:17:33,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:33,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:17:33,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:17:33,718 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:33,792 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-07-20 06:17:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:33,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-07-20 06:17:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:33,793 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:17:33,793 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:17:33,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:33,794 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:33,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 433 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:17:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-20 06:17:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-20 06:17:33,797 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2022-07-20 06:17:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:33,798 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-20 06:17:33,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-20 06:17:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:17:33,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:33,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:33,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 06:17:34,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:34,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2022-07-20 06:17:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:34,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600248317] [2022-07-20 06:17:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:17:34,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:34,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600248317] [2022-07-20 06:17:34,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600248317] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:34,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967799673] [2022-07-20 06:17:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:34,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:34,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:34,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:34,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:17:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:17:34,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:17:34,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:34,219 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:17:34,219 INFO L390 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 12 treesize of output 11 [2022-07-20 06:17:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:17:34,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967799673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:17:34,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:17:34,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-07-20 06:17:34,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092305395] [2022-07-20 06:17:34,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:34,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:17:34,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:34,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:17:34,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:17:34,234 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:34,318 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-07-20 06:17:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:34,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-07-20 06:17:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:34,319 INFO L225 Difference]: With dead ends: 113 [2022-07-20 06:17:34,320 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 06:17:34,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:34,320 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:34,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 06:17:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2022-07-20 06:17:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-07-20 06:17:34,323 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2022-07-20 06:17:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:34,323 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-07-20 06:17:34,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-07-20 06:17:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:17:34,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:34,324 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:34,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:34,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:34,538 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2022-07-20 06:17:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:34,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063094744] [2022-07-20 06:17:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:34,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:34,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063094744] [2022-07-20 06:17:34,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063094744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:34,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813093152] [2022-07-20 06:17:34,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:34,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:34,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:34,660 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:34,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:17:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:34,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 06:17:34,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:34,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:34,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:17:34,908 INFO L390 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 20 treesize of output 24 [2022-07-20 06:17:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:34,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813093152] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:17:34,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:17:34,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-20 06:17:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823312331] [2022-07-20 06:17:34,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:34,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:17:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:34,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:17:34,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:17:34,986 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:17:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:35,181 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-07-20 06:17:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:17:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-07-20 06:17:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:35,183 INFO L225 Difference]: With dead ends: 150 [2022-07-20 06:17:35,183 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:17:35,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:17:35,183 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:35,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 748 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:17:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:17:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-07-20 06:17:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-07-20 06:17:35,187 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2022-07-20 06:17:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:35,187 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-07-20 06:17:35,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:17:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-07-20 06:17:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:17:35,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:35,188 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:35,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:35,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 06:17:35,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:35,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2022-07-20 06:17:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:35,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910360973] [2022-07-20 06:17:35,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:35,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:17:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:35,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910360973] [2022-07-20 06:17:35,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910360973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:35,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:35,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:17:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375872520] [2022-07-20 06:17:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:17:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:17:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:35,459 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:35,610 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-07-20 06:17:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:17:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 06:17:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:35,612 INFO L225 Difference]: With dead ends: 111 [2022-07-20 06:17:35,612 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 06:17:35,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:17:35,612 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 135 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:35,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 294 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 06:17:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-20 06:17:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-07-20 06:17:35,615 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2022-07-20 06:17:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:35,615 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-07-20 06:17:35,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-07-20 06:17:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:17:35,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:35,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:35,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:17:35,616 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2022-07-20 06:17:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:35,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723885305] [2022-07-20 06:17:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:35,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723885305] [2022-07-20 06:17:35,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723885305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:35,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:35,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:17:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094681361] [2022-07-20 06:17:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:35,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:17:35,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:17:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:35,721 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:35,837 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-07-20 06:17:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:17:35,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-20 06:17:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:35,838 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:17:35,838 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:17:35,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:17:35,839 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 136 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:35,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 290 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:17:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-20 06:17:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2022-07-20 06:17:35,841 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2022-07-20 06:17:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:35,841 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2022-07-20 06:17:35,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2022-07-20 06:17:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:17:35,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:35,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:35,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:17:35,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2022-07-20 06:17:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450673468] [2022-07-20 06:17:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:17:35,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:35,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450673468] [2022-07-20 06:17:35,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450673468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:35,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:35,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:17:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552099518] [2022-07-20 06:17:35,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:35,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:17:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:17:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:17:35,938 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:36,317 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2022-07-20 06:17:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:17:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-07-20 06:17:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:36,318 INFO L225 Difference]: With dead ends: 158 [2022-07-20 06:17:36,318 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 06:17:36,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:17:36,319 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 320 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:36,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 509 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:17:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 06:17:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2022-07-20 06:17:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-20 06:17:36,321 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2022-07-20 06:17:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:36,321 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-20 06:17:36,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-20 06:17:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:17:36,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:36,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:36,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:17:36,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2022-07-20 06:17:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:36,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563343767] [2022-07-20 06:17:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:36,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:36,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:17:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:36,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563343767] [2022-07-20 06:17:36,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563343767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:36,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:36,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:17:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216512443] [2022-07-20 06:17:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:36,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:17:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:17:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:17:36,407 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:36,493 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-07-20 06:17:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-07-20 06:17:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:36,494 INFO L225 Difference]: With dead ends: 120 [2022-07-20 06:17:36,494 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 06:17:36,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:36,495 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:36,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 270 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 06:17:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2022-07-20 06:17:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-07-20 06:17:36,497 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 35 [2022-07-20 06:17:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:36,498 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-07-20 06:17:36,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-07-20 06:17:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:17:36,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:36,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:36,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:17:36,499 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:36,499 INFO L85 PathProgramCache]: Analyzing trace with hash 452746623, now seen corresponding path program 1 times [2022-07-20 06:17:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:36,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639422792] [2022-07-20 06:17:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:36,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:36,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639422792] [2022-07-20 06:17:36,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639422792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:36,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:36,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:17:36,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603262232] [2022-07-20 06:17:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:36,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:17:36,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:17:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:17:36,622 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:36,852 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-07-20 06:17:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:17:36,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-07-20 06:17:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:36,853 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:17:36,853 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 06:17:36,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:17:36,854 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 315 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:36,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 530 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:17:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 06:17:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2022-07-20 06:17:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2022-07-20 06:17:36,856 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 35 [2022-07-20 06:17:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:36,856 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2022-07-20 06:17:36,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-07-20 06:17:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:17:36,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:36,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:36,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:17:36,857 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2022-07-20 06:17:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:36,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405482628] [2022-07-20 06:17:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:37,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405482628] [2022-07-20 06:17:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405482628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680802070] [2022-07-20 06:17:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:37,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:37,173 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:37,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:17:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:37,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-20 06:17:37,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:37,334 INFO L390 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 [2022-07-20 06:17:37,404 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:17:37,404 INFO L390 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 11 [2022-07-20 06:17:37,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:17:37,485 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:17:37,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:17:37,526 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:17:37,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:17:37,557 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:17:37,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2022-07-20 06:17:37,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:17:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:17:37,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:37,656 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-20 06:17:37,657 INFO L390 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 19 treesize of output 18 [2022-07-20 06:17:37,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-07-20 06:17:37,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2022-07-20 06:17:37,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1578 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-07-20 06:17:37,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:17:37,678 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-20 06:17:37,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-07-20 06:17:37,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-20 06:17:37,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-20 06:17:37,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680802070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:37,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:17:37,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2022-07-20 06:17:37,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954982989] [2022-07-20 06:17:37,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:37,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:17:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:37,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:17:37,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=980, Unknown=3, NotChecked=192, Total=1260 [2022-07-20 06:17:37,768 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:38,570 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-07-20 06:17:38,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:17:38,571 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-07-20 06:17:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:38,572 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:17:38,572 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:17:38,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1610, Unknown=3, NotChecked=252, Total=2070 [2022-07-20 06:17:38,573 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 211 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:38,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1222 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:17:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:17:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-07-20 06:17:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-07-20 06:17:38,576 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 38 [2022-07-20 06:17:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:38,576 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-07-20 06:17:38,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-07-20 06:17:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:17:38,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:38,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:38,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:38,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-20 06:17:38,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337164, now seen corresponding path program 1 times [2022-07-20 06:17:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:38,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550086936] [2022-07-20 06:17:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:39,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550086936] [2022-07-20 06:17:39,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550086936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566645056] [2022-07-20 06:17:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:39,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:39,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:39,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:39,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:17:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:39,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-20 06:17:39,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:39,360 INFO L390 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 [2022-07-20 06:17:39,363 INFO L390 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 [2022-07-20 06:17:39,605 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:17:39,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:17:39,620 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:17:39,621 INFO L390 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 11 [2022-07-20 06:17:39,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:17:39,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:17:39,768 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:17:39,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2022-07-20 06:17:39,772 INFO L390 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 18 treesize of output 20 [2022-07-20 06:17:39,893 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:17:39,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:17:39,897 INFO L390 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 18 treesize of output 20 [2022-07-20 06:17:39,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:17:39,938 INFO L390 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 31 treesize of output 26 [2022-07-20 06:17:39,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:17:39,944 INFO L390 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 [2022-07-20 06:17:40,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:17:40,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 06:17:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:17:40,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:40,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:17:40,563 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-20 06:17:40,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:17:40,568 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 06:17:40,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2022-07-20 06:17:40,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 314 [2022-07-20 06:17:40,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 150 [2022-07-20 06:17:40,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 286 [2022-07-20 06:17:40,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 270 [2022-07-20 06:17:40,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 262 [2022-07-20 06:17:40,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:17:40,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 06:17:40,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:17:40,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:17:40,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2022-07-20 06:17:49,066 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:17:49,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566645056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:49,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:17:49,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2022-07-20 06:17:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252808993] [2022-07-20 06:17:49,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:49,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:17:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:17:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2508, Unknown=2, NotChecked=0, Total=2652 [2022-07-20 06:17:49,069 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:17:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:50,917 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2022-07-20 06:17:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:17:50,918 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-07-20 06:17:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:50,919 INFO L225 Difference]: With dead ends: 216 [2022-07-20 06:17:50,919 INFO L226 Difference]: Without dead ends: 216 [2022-07-20 06:17:50,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=351, Invalid=3937, Unknown=2, NotChecked=0, Total=4290 [2022-07-20 06:17:50,920 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1178 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:50,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 2417 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1672 Invalid, 0 Unknown, 107 Unchecked, 0.7s Time] [2022-07-20 06:17:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-20 06:17:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 113. [2022-07-20 06:17:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 108 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:17:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-07-20 06:17:50,927 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 38 [2022-07-20 06:17:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:50,927 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-07-20 06:17:50,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 06:17:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-07-20 06:17:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:17:50,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:50,929 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:50,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:51,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:51,139 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2022-07-20 06:17:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134912351] [2022-07-20 06:17:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 06:17:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-20 06:17:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134912351] [2022-07-20 06:17:51,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134912351] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499266286] [2022-07-20 06:17:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:51,222 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:51,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:17:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:17:51,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:17:51,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:17:51,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499266286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:51,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:17:51,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-20 06:17:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769185590] [2022-07-20 06:17:51,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:51,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:17:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:51,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:17:51,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:17:51,403 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:51,410 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-07-20 06:17:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:17:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-20 06:17:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:51,411 INFO L225 Difference]: With dead ends: 96 [2022-07-20 06:17:51,411 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 06:17:51,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:17:51,412 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:51,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:17:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 06:17:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-20 06:17:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 92 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2022-07-20 06:17:51,414 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 41 [2022-07-20 06:17:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:51,415 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2022-07-20 06:17:51,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 06:17:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-07-20 06:17:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:17:51,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:51,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:51,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:51,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 06:17:51,634 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:51,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash -784093497, now seen corresponding path program 2 times [2022-07-20 06:17:51,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:51,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653748846] [2022-07-20 06:17:51,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:17:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:51,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653748846] [2022-07-20 06:17:51,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653748846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:51,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:51,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:17:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204858407] [2022-07-20 06:17:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:51,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:17:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:51,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:17:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:17:51,710 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:51,783 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-07-20 06:17:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:51,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-07-20 06:17:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:51,784 INFO L225 Difference]: With dead ends: 82 [2022-07-20 06:17:51,784 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 06:17:51,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:17:51,785 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 101 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:51,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 181 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 06:17:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-20 06:17:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 78 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-20 06:17:51,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 41 [2022-07-20 06:17:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:51,788 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-20 06:17:51,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-20 06:17:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:17:51,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:51,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:51,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:17:51,789 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584715, now seen corresponding path program 1 times [2022-07-20 06:17:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:51,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504653469] [2022-07-20 06:17:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:17:51,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:51,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504653469] [2022-07-20 06:17:51,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504653469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:51,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:51,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:17:51,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227636691] [2022-07-20 06:17:51,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:51,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:17:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:17:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:17:51,882 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:52,047 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-07-20 06:17:52,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:17:52,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-20 06:17:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:52,048 INFO L225 Difference]: With dead ends: 107 [2022-07-20 06:17:52,048 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 06:17:52,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:17:52,048 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 274 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:52,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 307 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 06:17:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2022-07-20 06:17:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2022-07-20 06:17:52,050 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 45 [2022-07-20 06:17:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:52,050 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2022-07-20 06:17:52,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-07-20 06:17:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:17:52,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:52,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:52,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:17:52,051 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584714, now seen corresponding path program 1 times [2022-07-20 06:17:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:52,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889201287] [2022-07-20 06:17:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:17:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:52,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889201287] [2022-07-20 06:17:52,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889201287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:52,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133445360] [2022-07-20 06:17:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:52,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:52,125 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:52,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:17:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:17:52,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:17:52,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:17:52,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133445360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:17:52,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:17:52,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-20 06:17:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984961260] [2022-07-20 06:17:52,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:52,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:17:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:52,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:17:52,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:17:52,381 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:17:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:52,437 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-20 06:17:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:17:52,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-20 06:17:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:52,438 INFO L225 Difference]: With dead ends: 107 [2022-07-20 06:17:52,438 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 06:17:52,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:17:52,439 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 118 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:52,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 311 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 06:17:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2022-07-20 06:17:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 97 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-07-20 06:17:52,442 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 45 [2022-07-20 06:17:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:52,442 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-07-20 06:17:52,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:17:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-07-20 06:17:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:17:52,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:52,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:52,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:52,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:52,657 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1454244195, now seen corresponding path program 1 times [2022-07-20 06:17:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:52,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654893478] [2022-07-20 06:17:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:17:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:52,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654893478] [2022-07-20 06:17:52,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654893478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:52,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492956275] [2022-07-20 06:17:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:52,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:52,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:52,722 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:52,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:17:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:52,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:17:52,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:17:52,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:17:53,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492956275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:17:53,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:17:53,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-07-20 06:17:53,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719377527] [2022-07-20 06:17:53,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:17:53,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:17:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:53,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:17:53,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:17:53,012 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:17:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:53,071 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-07-20 06:17:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:53,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-07-20 06:17:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:53,072 INFO L225 Difference]: With dead ends: 102 [2022-07-20 06:17:53,072 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 06:17:53,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:17:53,075 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 230 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:53,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 243 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:17:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 06:17:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2022-07-20 06:17:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2022-07-20 06:17:53,084 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 46 [2022-07-20 06:17:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:53,085 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2022-07-20 06:17:53,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:17:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2022-07-20 06:17:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 06:17:53,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:53,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:53,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:17:53,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-20 06:17:53,300 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:53,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:53,300 INFO L85 PathProgramCache]: Analyzing trace with hash -748626798, now seen corresponding path program 2 times [2022-07-20 06:17:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:53,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662138744] [2022-07-20 06:17:53,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:53,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:53,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:53,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 06:17:53,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:53,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662138744] [2022-07-20 06:17:53,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662138744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:53,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:53,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:17:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312723550] [2022-07-20 06:17:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:53,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:17:53,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:17:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:17:53,370 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:53,430 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-20 06:17:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:17:53,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-07-20 06:17:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:53,431 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:17:53,431 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:17:53,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:17:53,432 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 88 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:53,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 239 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:17:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:17:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-07-20 06:17:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2022-07-20 06:17:53,438 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 50 [2022-07-20 06:17:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:53,438 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2022-07-20 06:17:53,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-07-20 06:17:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 06:17:53,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:53,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:53,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:17:53,439 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash -748626743, now seen corresponding path program 1 times [2022-07-20 06:17:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:53,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234169479] [2022-07-20 06:17:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:17:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:53,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234169479] [2022-07-20 06:17:53,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234169479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:17:53,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:17:53,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:17:53,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712836257] [2022-07-20 06:17:53,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:17:53,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:17:53,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:17:53,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:17:53,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:17:53,575 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:17:53,773 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2022-07-20 06:17:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:17:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-07-20 06:17:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:17:53,774 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:17:53,775 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:17:53,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:17:53,776 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 378 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:17:53,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 337 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:17:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:17:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2022-07-20 06:17:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 91 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:17:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-20 06:17:53,780 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 50 [2022-07-20 06:17:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:17:53,781 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-20 06:17:53,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:17:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-20 06:17:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 06:17:53,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:17:53,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:17:53,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 06:17:53,782 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:17:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:17:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902980, now seen corresponding path program 1 times [2022-07-20 06:17:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:17:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445313765] [2022-07-20 06:17:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:17:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:17:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:17:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:17:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:17:54,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445313765] [2022-07-20 06:17:54,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445313765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:17:54,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013938238] [2022-07-20 06:17:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:17:54,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:17:54,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:17:54,299 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:17:54,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:17:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:17:54,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-20 06:17:54,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:17:54,578 INFO L390 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 [2022-07-20 06:17:54,677 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:17:54,677 INFO L390 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 11 [2022-07-20 06:17:54,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:17:54,737 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:17:54,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:17:54,763 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:17:54,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:17:54,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:17:54,771 INFO L390 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 31 treesize of output 26 [2022-07-20 06:17:54,932 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:17:54,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:17:55,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:17:55,000 INFO L390 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 31 treesize of output 26 [2022-07-20 06:17:55,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:17:55,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:17:55,068 INFO L390 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 25 treesize of output 16 [2022-07-20 06:17:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:17:55,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:17:58,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2989) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:17:58,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_2989) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:17:59,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2989) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) 1))) is different from false [2022-07-20 06:18:00,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (= 1 (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_2989) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |c_ULTIMATE.start_dll_circular_create_#res#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|))) is different from false [2022-07-20 06:18:00,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2989) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|))) is different from false [2022-07-20 06:18:01,734 INFO L356 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2022-07-20 06:18:01,735 INFO L390 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 47 treesize of output 46 [2022-07-20 06:18:01,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (v_ArrVal_2988 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2988)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|))) is different from false [2022-07-20 06:18:01,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2990 Int) (v_ArrVal_2988 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2988)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)))) is different from false [2022-07-20 06:18:01,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2990 Int) (v_ArrVal_2988 Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10| Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2985) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2988)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_2990) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (<= 0 |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_10|)))) is different from false [2022-07-20 06:18:01,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:01,825 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 56 [2022-07-20 06:18:01,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 388 [2022-07-20 06:18:01,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:01,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:01,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:01,851 INFO L390 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 362 treesize of output 358 [2022-07-20 06:18:01,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:01,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:01,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:01,864 INFO L390 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 162 treesize of output 156 [2022-07-20 06:18:01,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:01,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-07-20 06:18:01,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:01,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:01,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:01,883 INFO L390 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 222 treesize of output 206 [2022-07-20 06:18:02,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013938238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:02,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:02,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 33 [2022-07-20 06:18:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65381610] [2022-07-20 06:18:02,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:02,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:18:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:02,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:18:02,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1645, Unknown=22, NotChecked=712, Total=2550 [2022-07-20 06:18:02,536 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:03,296 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2022-07-20 06:18:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:18:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-07-20 06:18:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:03,297 INFO L225 Difference]: With dead ends: 158 [2022-07-20 06:18:03,297 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 06:18:03,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=358, Invalid=2732, Unknown=22, NotChecked=920, Total=4032 [2022-07-20 06:18:03,299 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 489 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:03,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1078 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:18:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 06:18:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-07-20 06:18:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 99 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-07-20 06:18:03,304 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 53 [2022-07-20 06:18:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:03,305 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-07-20 06:18:03,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-07-20 06:18:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 06:18:03,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:03,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:03,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:03,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 06:18:03,526 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902981, now seen corresponding path program 1 times [2022-07-20 06:18:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:03,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256979766] [2022-07-20 06:18:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:18:04,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:04,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256979766] [2022-07-20 06:18:04,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256979766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:04,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565767296] [2022-07-20 06:18:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:04,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:04,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:04,159 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:04,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:18:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:04,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-20 06:18:04,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:04,381 INFO L390 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 [2022-07-20 06:18:04,589 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:18:04,589 INFO L390 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 11 [2022-07-20 06:18:04,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:18:04,681 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:04,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:18:04,791 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:04,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-20 06:18:04,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:04,837 INFO L390 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 22 treesize of output 21 [2022-07-20 06:18:04,841 INFO L390 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 6 treesize of output 5 [2022-07-20 06:18:05,035 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:05,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-20 06:18:05,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:05,039 INFO L390 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 35 treesize of output 35 [2022-07-20 06:18:05,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:05,162 INFO L390 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 38 treesize of output 33 [2022-07-20 06:18:05,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:05,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-20 06:18:05,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-20 06:18:05,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 16 [2022-07-20 06:18:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:05,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:07,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_3194 Int) (v_ArrVal_3195 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3194) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_3195 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:18:07,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:07,655 INFO L390 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 58 treesize of output 62 [2022-07-20 06:18:16,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:16,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-07-20 06:18:16,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:16,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-20 06:18:16,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3188 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-20 06:18:16,398 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3188 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-20 06:18:16,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3187 (Array Int Int)) (v_ArrVal_3188 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3187) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-20 06:18:16,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:16,408 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 06:18:16,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-07-20 06:18:16,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:18:16,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:18:16,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:18:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-20 06:18:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565767296] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:16,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:16,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 72 [2022-07-20 06:18:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955026537] [2022-07-20 06:18:16,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:16,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-20 06:18:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-20 06:18:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4464, Unknown=4, NotChecked=548, Total=5256 [2022-07-20 06:18:16,882 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:18,661 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 12 (select |c_#length| .cse0)) (<= 12 (select |c_#length| .cse1)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_3194 Int) (v_ArrVal_3195 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3194) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_3195 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse3 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse3 0) (not (= (select .cse4 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1))))) is different from false [2022-07-20 06:18:19,121 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select |c_#length| (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 12 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse1 12) .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_3194 Int) (v_ArrVal_3195 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3194) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_3195 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3195) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 (+ .cse1 8)) (= .cse1 0) (not (= (select .cse3 0) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2022-07-20 06:18:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:20,557 INFO L93 Difference]: Finished difference Result 319 states and 356 transitions. [2022-07-20 06:18:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 06:18:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-07-20 06:18:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:20,558 INFO L225 Difference]: With dead ends: 319 [2022-07-20 06:18:20,558 INFO L226 Difference]: Without dead ends: 319 [2022-07-20 06:18:20,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=661, Invalid=8099, Unknown=6, NotChecked=1134, Total=9900 [2022-07-20 06:18:20,561 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 937 mSDsluCounter, 3517 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1404 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:20,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 3621 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2074 Invalid, 0 Unknown, 1404 Unchecked, 0.8s Time] [2022-07-20 06:18:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-20 06:18:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 102. [2022-07-20 06:18:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2022-07-20 06:18:20,564 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 53 [2022-07-20 06:18:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:20,565 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2022-07-20 06:18:20,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2022-07-20 06:18:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 06:18:20,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:20,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:20,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:20,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-20 06:18:20,766 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:20,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1850823601, now seen corresponding path program 2 times [2022-07-20 06:18:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:20,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296779065] [2022-07-20 06:18:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:20,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:20,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 06:18:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296779065] [2022-07-20 06:18:20,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296779065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:20,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:20,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:18:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33555558] [2022-07-20 06:18:20,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:20,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:18:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:20,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:18:20,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:18:20,851 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:20,922 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-07-20 06:18:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:18:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-07-20 06:18:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:20,925 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:18:20,925 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:18:20,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:18:20,926 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 157 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:20,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 150 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:18:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:18:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 84 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-07-20 06:18:20,928 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 56 [2022-07-20 06:18:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:20,929 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-07-20 06:18:20,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-07-20 06:18:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 06:18:20,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:20,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:20,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 06:18:20,930 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:20,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1490386454, now seen corresponding path program 1 times [2022-07-20 06:18:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:20,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341054699] [2022-07-20 06:18:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:20,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:18:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:21,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341054699] [2022-07-20 06:18:21,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341054699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:21,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918122947] [2022-07-20 06:18:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:21,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:21,696 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:21,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 06:18:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:21,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-20 06:18:21,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:21,944 INFO L390 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 [2022-07-20 06:18:22,119 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:18:22,119 INFO L390 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 11 [2022-07-20 06:18:22,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:18:22,243 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:22,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:18:22,331 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:22,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 06:18:22,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:22,341 INFO L390 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 26 treesize of output 21 [2022-07-20 06:18:22,346 INFO L390 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 6 treesize of output 5 [2022-07-20 06:18:22,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:22,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-07-20 06:18:22,681 INFO L390 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 29 treesize of output 21 [2022-07-20 06:18:22,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:22,684 INFO L390 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 32 treesize of output 34 [2022-07-20 06:18:22,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:22,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:22,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:22,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-07-20 06:18:22,846 INFO L390 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 30 treesize of output 32 [2022-07-20 06:18:22,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:22,851 INFO L390 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 37 treesize of output 36 [2022-07-20 06:18:23,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:23,113 INFO L390 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 59 treesize of output 35 [2022-07-20 06:18:23,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 24 [2022-07-20 06:18:23,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-20 06:18:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:23,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:23,612 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3521) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_3519)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_3520)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3521) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_3519)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_3520)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2022-07-20 06:18:23,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) is different from false [2022-07-20 06:18:23,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,684 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:23,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,690 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:23,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:23,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,726 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:23,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,748 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:23,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:23,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int) (|#memory_int| (Array Int (Array Int Int))) (v_ArrVal_3516 (Array Int Int)) (v_ArrVal_3517 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1)))))) is different from false [2022-07-20 06:18:23,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,792 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:23,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,798 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:23,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:23,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,820 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:23,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,826 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:23,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:23,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,866 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:23,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,889 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:23,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:23,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,925 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:23,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,931 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:23,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:23,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,978 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:23,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:23,984 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:23,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:24,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:24,007 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-20 06:18:24,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:24,022 INFO L390 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 104 treesize of output 107 [2022-07-20 06:18:24,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-20 06:18:24,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| 8) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-20 06:18:24,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:18:24,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))))) is different from false [2022-07-20 06:18:24,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) is different from false [2022-07-20 06:18:24,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2022-07-20 06:18:24,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:24,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-20 06:18:24,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:24,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-20 06:18:24,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3511 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-20 06:18:24,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3511 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:18:24,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3511 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3510) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:18:24,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:24,215 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 06:18:24,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2022-07-20 06:18:24,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:18:24,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:18:24,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 06:18:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-20 06:18:24,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918122947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:24,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:24,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 31] total 83 [2022-07-20 06:18:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606856596] [2022-07-20 06:18:24,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:24,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-20 06:18:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:24,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-20 06:18:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4919, Unknown=11, NotChecked=1650, Total=6806 [2022-07-20 06:18:24,593 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:27,131 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse3 (select .cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse1 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= .cse3 .cse1) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-07-20 06:18:29,146 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (select .cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8) (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= .cse1 .cse2) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0)))) is different from false [2022-07-20 06:18:31,164 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (select .cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= .cse4 .cse3) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~i~0#1| (+ |c_ULTIMATE.start_main_~len~0#1| (- 1))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:18:31,724 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (select .cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 8) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse1 .cse2) (<= .cse2 .cse1) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse3))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|) .cse4) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:18:32,284 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select .cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| .cse1) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse4 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse3 .cse4) (<= .cse4 .cse3) (forall ((v_ArrVal_3517 (Array Int Int)) (v_ArrVal_3519 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3516 (Array Int Int))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| 8) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (= .cse1 0) (= .cse2 .cse5) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:18:32,292 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select .cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (= .cse1 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (= .cse3 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int) (|#memory_int| (Array Int (Array Int Int))) (v_ArrVal_3516 (Array Int Int)) (v_ArrVal_3517 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) .cse5 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~s~0#1.base|) .cse5 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1)))))) (= .cse3 0) (= .cse1 .cse2) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:18:32,297 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| .cse6)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select .cse7 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select .cse0 8) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (= (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (select .cse0 (+ .cse5 8))) (= .cse5 0) (= .cse6 .cse4) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse6)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-20 06:18:32,323 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse5 (select |c_#memory_int| .cse7))) (let ((.cse0 (+ (select .cse5 8) 1)) (.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (select .cse8 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3520 Int) (v_ArrVal_3519 Int)) (<= (+ (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3521) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3519) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (= (+ (- 1) .cse1) (select .cse5 (+ .cse6 8))) (= .cse6 0) (= .cse7 .cse4) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse7)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-20 06:18:33,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:33,771 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-07-20 06:18:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 06:18:33,771 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-07-20 06:18:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:33,772 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:18:33,772 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:18:33,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=481, Invalid=7408, Unknown=19, NotChecked=3648, Total=11556 [2022-07-20 06:18:33,774 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 195 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 784 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:33,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1669 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1417 Invalid, 0 Unknown, 784 Unchecked, 0.5s Time] [2022-07-20 06:18:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:18:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 06:18:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-07-20 06:18:33,779 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 57 [2022-07-20 06:18:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:33,780 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-07-20 06:18:33,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 06:18:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-07-20 06:18:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 06:18:33,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:33,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:33,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:33,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 06:18:33,992 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1792642665, now seen corresponding path program 1 times [2022-07-20 06:18:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:33,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998372530] [2022-07-20 06:18:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:34,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:18:34,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:34,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998372530] [2022-07-20 06:18:34,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998372530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:34,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927782785] [2022-07-20 06:18:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:34,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:34,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:34,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:34,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 06:18:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:34,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-20 06:18:34,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:34,776 INFO L390 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 17 treesize of output 13 [2022-07-20 06:18:34,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 06:18:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:18:35,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:35,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2022-07-20 06:18:35,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:35,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:18:35,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927782785] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:35,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:35,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 38 [2022-07-20 06:18:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513099447] [2022-07-20 06:18:35,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:35,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:18:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:35,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:18:35,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 06:18:35,324 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 06:18:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:36,186 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-20 06:18:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:18:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-07-20 06:18:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:36,187 INFO L225 Difference]: With dead ends: 122 [2022-07-20 06:18:36,187 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 06:18:36,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=2244, Unknown=0, NotChecked=0, Total=2652 [2022-07-20 06:18:36,188 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 837 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:36,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 942 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:18:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 06:18:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2022-07-20 06:18:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 88 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-20 06:18:36,190 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 64 [2022-07-20 06:18:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:36,190 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-20 06:18:36,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 06:18:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-20 06:18:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-20 06:18:36,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:36,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:36,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:36,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:36,391 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash 3674256, now seen corresponding path program 2 times [2022-07-20 06:18:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:36,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16692870] [2022-07-20 06:18:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:36,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:36,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16692870] [2022-07-20 06:18:36,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16692870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:36,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555987876] [2022-07-20 06:18:36,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:18:36,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:36,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:36,513 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:36,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 06:18:36,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:18:36,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:18:36,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:18:36,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:36,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:18:36,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555987876] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:36,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:36,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-07-20 06:18:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985485367] [2022-07-20 06:18:36,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:36,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:18:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:36,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:18:36,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:18:36,986 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:18:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:37,065 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-07-20 06:18:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:18:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2022-07-20 06:18:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:37,066 INFO L225 Difference]: With dead ends: 83 [2022-07-20 06:18:37,066 INFO L226 Difference]: Without dead ends: 83 [2022-07-20 06:18:37,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:18:37,067 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 226 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:37,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 192 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-20 06:18:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-20 06:18:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-07-20 06:18:37,069 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2022-07-20 06:18:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:37,069 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-07-20 06:18:37,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 06:18:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-07-20 06:18:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 06:18:37,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:37,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:37,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:37,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:37,289 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 775968223, now seen corresponding path program 1 times [2022-07-20 06:18:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:37,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43092305] [2022-07-20 06:18:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:18:37,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:37,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43092305] [2022-07-20 06:18:37,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43092305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:37,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:37,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:18:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615347616] [2022-07-20 06:18:37,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:37,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:18:37,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:37,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:18:37,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:18:37,344 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:37,436 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-07-20 06:18:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:18:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-07-20 06:18:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:37,437 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:18:37,437 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:18:37,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:18:37,438 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 99 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:37,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 220 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:18:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2022-07-20 06:18:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-07-20 06:18:37,442 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 68 [2022-07-20 06:18:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:37,442 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-07-20 06:18:37,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-07-20 06:18:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 06:18:37,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:37,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:37,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 06:18:37,444 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash 775968224, now seen corresponding path program 1 times [2022-07-20 06:18:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:37,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73287849] [2022-07-20 06:18:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:18:37,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:37,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73287849] [2022-07-20 06:18:37,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73287849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:37,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:37,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:18:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139489434] [2022-07-20 06:18:37,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:37,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:18:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:18:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:18:37,627 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:37,874 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-07-20 06:18:37,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:18:37,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-07-20 06:18:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:37,875 INFO L225 Difference]: With dead ends: 84 [2022-07-20 06:18:37,875 INFO L226 Difference]: Without dead ends: 84 [2022-07-20 06:18:37,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:18:37,877 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 196 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:37,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 245 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-20 06:18:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-20 06:18:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.178082191780822) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-20 06:18:37,880 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 68 [2022-07-20 06:18:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:37,881 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-20 06:18:37,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-20 06:18:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 06:18:37,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:37,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:37,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 06:18:37,882 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1714754975, now seen corresponding path program 1 times [2022-07-20 06:18:37,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:37,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705324692] [2022-07-20 06:18:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:18:38,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:38,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705324692] [2022-07-20 06:18:38,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705324692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:38,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:38,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:18:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694397934] [2022-07-20 06:18:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:38,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:18:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:18:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:18:38,004 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:38,151 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-07-20 06:18:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:18:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2022-07-20 06:18:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:38,152 INFO L225 Difference]: With dead ends: 84 [2022-07-20 06:18:38,152 INFO L226 Difference]: Without dead ends: 84 [2022-07-20 06:18:38,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:18:38,153 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 188 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:38,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 265 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-20 06:18:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-20 06:18:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-20 06:18:38,155 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 69 [2022-07-20 06:18:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:38,155 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-20 06:18:38,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-20 06:18:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 06:18:38,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:38,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:38,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-20 06:18:38,159 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436959, now seen corresponding path program 1 times [2022-07-20 06:18:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:38,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509738234] [2022-07-20 06:18:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 06:18:38,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:38,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509738234] [2022-07-20 06:18:38,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509738234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:38,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576297775] [2022-07-20 06:18:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:38,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:38,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:38,260 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:38,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 06:18:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:38,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-20 06:18:38,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:38,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 06:18:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 06:18:38,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:38,980 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-20 06:18:38,980 INFO L390 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 16 treesize of output 15 [2022-07-20 06:18:39,043 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:18:39,043 INFO L390 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 11 treesize of output 11 [2022-07-20 06:18:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 06:18:39,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576297775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:39,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:39,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2022-07-20 06:18:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486965147] [2022-07-20 06:18:39,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:39,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 06:18:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:39,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 06:18:39,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-07-20 06:18:39,106 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 27 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 states have internal predecessors, (113), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 06:18:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:39,601 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-20 06:18:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:18:39,602 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 states have internal predecessors, (113), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-07-20 06:18:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:39,602 INFO L225 Difference]: With dead ends: 92 [2022-07-20 06:18:39,602 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 06:18:39,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 06:18:39,603 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 310 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:39,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 555 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:18:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 06:18:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-20 06:18:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.162162162162162) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-20 06:18:39,605 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 71 [2022-07-20 06:18:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:39,605 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-20 06:18:39,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 states have internal predecessors, (113), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 06:18:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-20 06:18:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 06:18:39,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:39,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:39,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:39,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-20 06:18:39,827 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436960, now seen corresponding path program 1 times [2022-07-20 06:18:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:39,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526509273] [2022-07-20 06:18:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:18:40,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:40,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526509273] [2022-07-20 06:18:40,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526509273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:40,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005704616] [2022-07-20 06:18:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:40,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:40,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:40,680 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:40,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 06:18:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:41,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-20 06:18:41,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:41,109 INFO L390 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 [2022-07-20 06:18:41,360 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:18:41,360 INFO L390 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 11 [2022-07-20 06:18:41,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:18:41,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:18:41,558 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:41,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-20 06:18:41,561 INFO L390 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 18 treesize of output 20 [2022-07-20 06:18:41,715 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:18:41,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 06:18:41,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:41,745 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:41,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 06:18:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:41,803 INFO L390 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 [2022-07-20 06:18:41,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:41,812 INFO L390 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 26 treesize of output 21 [2022-07-20 06:18:42,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:42,104 INFO L390 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 29 treesize of output 11 [2022-07-20 06:18:42,210 INFO L390 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 23 treesize of output 23 [2022-07-20 06:18:42,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:42,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:42,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:42,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:42,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 06:18:42,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-20 06:18:42,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:42,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:42,725 INFO L390 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 35 treesize of output 17 [2022-07-20 06:18:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:18:42,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:43,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:43,041 INFO L390 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 32 treesize of output 36 [2022-07-20 06:18:43,193 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:18:43,193 INFO L390 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 11 treesize of output 11 [2022-07-20 06:18:45,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:45,030 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2022-07-20 06:18:45,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 256 [2022-07-20 06:18:45,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:45,037 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 196 [2022-07-20 06:18:45,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1028 treesize of output 960 [2022-07-20 06:18:45,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 796 treesize of output 764 [2022-07-20 06:18:45,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 764 treesize of output 700 [2022-07-20 06:18:45,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 700 treesize of output 696 [2022-07-20 06:18:45,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 696 treesize of output 688 [2022-07-20 06:18:45,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 342 [2022-07-20 06:18:45,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005704616] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:45,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:45,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 54 [2022-07-20 06:18:45,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448433479] [2022-07-20 06:18:45,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:45,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-20 06:18:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:45,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-20 06:18:45,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=5554, Unknown=14, NotChecked=0, Total=5852 [2022-07-20 06:18:45,344 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:47,441 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-07-20 06:18:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 06:18:47,442 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-07-20 06:18:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:47,442 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:18:47,442 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:18:47,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=729, Invalid=9157, Unknown=14, NotChecked=0, Total=9900 [2022-07-20 06:18:47,443 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 586 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:47,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1049 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:18:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:18:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2022-07-20 06:18:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.144736842105263) internal successors, (87), 82 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-07-20 06:18:47,445 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 71 [2022-07-20 06:18:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:47,445 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-07-20 06:18:47,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-07-20 06:18:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 06:18:47,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:47,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:47,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-20 06:18:47,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:47,646 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash -931128602, now seen corresponding path program 1 times [2022-07-20 06:18:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:47,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518766977] [2022-07-20 06:18:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:47,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:18:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:47,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518766977] [2022-07-20 06:18:47,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518766977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:18:47,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:18:47,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:18:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820775310] [2022-07-20 06:18:47,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:18:47,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:18:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:18:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:18:47,750 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:47,885 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-07-20 06:18:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:18:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2022-07-20 06:18:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:47,886 INFO L225 Difference]: With dead ends: 85 [2022-07-20 06:18:47,886 INFO L226 Difference]: Without dead ends: 85 [2022-07-20 06:18:47,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:18:47,887 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 173 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:47,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 230 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:18:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-20 06:18:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-20 06:18:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.118421052631579) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-07-20 06:18:47,889 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 72 [2022-07-20 06:18:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:47,889 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-07-20 06:18:47,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 06:18:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-07-20 06:18:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 06:18:47,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:47,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:47,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-20 06:18:47,890 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:47,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1459966101, now seen corresponding path program 1 times [2022-07-20 06:18:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:47,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748285807] [2022-07-20 06:18:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:18:48,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:48,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748285807] [2022-07-20 06:18:48,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748285807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:48,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404150142] [2022-07-20 06:18:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:48,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:48,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:48,376 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:48,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 06:18:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:48,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-20 06:18:48,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:48,685 INFO L390 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 [2022-07-20 06:18:48,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:18:48,817 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:18:48,817 INFO L390 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 11 [2022-07-20 06:18:48,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:18:48,936 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:48,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-07-20 06:18:49,020 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:49,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:18:49,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:49,035 INFO L390 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 31 treesize of output 26 [2022-07-20 06:18:49,171 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:49,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:18:49,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:49,230 INFO L390 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 31 treesize of output 26 [2022-07-20 06:18:49,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:18:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 06:18:49,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:49,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:18:49,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:18:49,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:18:49,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:18:49,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4974) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-20 06:18:49,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_4974) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2022-07-20 06:18:49,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_4975 Int) (v_ArrVal_4974 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4974) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_36| 8) v_ArrVal_4975) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:18:50,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:50,103 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 58 [2022-07-20 06:18:50,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 420 [2022-07-20 06:18:50,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:50,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 358 [2022-07-20 06:18:50,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:50,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:50,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 294 [2022-07-20 06:18:50,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:50,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:50,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 131 [2022-07-20 06:18:50,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:50,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:18:50,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 234 [2022-07-20 06:18:50,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404150142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:50,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:18:50,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 39 [2022-07-20 06:18:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880098894] [2022-07-20 06:18:50,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:50,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:18:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:18:50,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2189, Unknown=9, NotChecked=700, Total=3080 [2022-07-20 06:18:50,355 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:18:51,384 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-07-20 06:18:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:18:51,385 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 74 [2022-07-20 06:18:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:18:51,385 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:18:51,385 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:18:51,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=372, Invalid=3429, Unknown=9, NotChecked=882, Total=4692 [2022-07-20 06:18:51,386 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 214 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:18:51,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 731 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:18:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:18:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-07-20 06:18:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:18:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-07-20 06:18:51,388 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 74 [2022-07-20 06:18:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:18:51,388 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-07-20 06:18:51,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 06:18:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-07-20 06:18:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-20 06:18:51,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:18:51,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:18:51,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:18:51,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:51,599 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:18:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:18:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1941762549, now seen corresponding path program 1 times [2022-07-20 06:18:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:18:51,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528874349] [2022-07-20 06:18:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:18:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:51,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:18:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:18:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 06:18:51,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:18:51,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528874349] [2022-07-20 06:18:51,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528874349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:18:51,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682976623] [2022-07-20 06:18:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:18:51,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:18:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:18:51,979 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:18:52,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 06:18:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:18:52,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-20 06:18:52,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:18:52,296 INFO L390 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 [2022-07-20 06:18:52,377 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:18:52,378 INFO L390 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 11 [2022-07-20 06:18:52,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:18:52,443 INFO L390 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 14 treesize of output 16 [2022-07-20 06:18:52,488 INFO L390 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 14 treesize of output 16 [2022-07-20 06:18:52,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:52,497 INFO L390 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 26 treesize of output 21 [2022-07-20 06:18:52,702 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:18:52,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2022-07-20 06:18:52,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:52,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:52,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:52,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:52,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-07-20 06:18:52,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:18:52,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:52,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:18:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:18:53,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:18:54,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,467 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,484 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5174 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5174) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-07-20 06:18:54,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:54,533 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 57 [2022-07-20 06:18:54,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 405 [2022-07-20 06:18:54,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:54,546 INFO L390 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 574 treesize of output 559 [2022-07-20 06:18:54,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 654 treesize of output 638 [2022-07-20 06:18:54,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:54,563 INFO L390 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 874 treesize of output 867 [2022-07-20 06:18:54,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:18:54,576 INFO L390 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 1101 treesize of output 1091 [2022-07-20 06:18:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2022-07-20 06:18:55,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682976623] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:18:55,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:18:55,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 28] total 70 [2022-07-20 06:18:55,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380899727] [2022-07-20 06:18:55,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:18:55,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-20 06:18:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:18:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-20 06:18:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3229, Unknown=11, NotChecked=1364, Total=4830 [2022-07-20 06:18:55,246 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:18:55,955 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))))) is different from false [2022-07-20 06:18:56,400 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5175))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2022-07-20 06:18:56,790 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5178)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2022-07-20 06:19:02,155 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse1)) (<= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select .cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= .cse1 (select .cse5 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:19:02,529 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:19:02,894 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| .cse0) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:19:03,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:19:03,573 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((v_ArrVal_5180 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5180) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:19:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:19:03,821 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-07-20 06:19:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:19:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 75 [2022-07-20 06:19:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:19:03,824 INFO L225 Difference]: With dead ends: 84 [2022-07-20 06:19:03,824 INFO L226 Difference]: Without dead ends: 84 [2022-07-20 06:19:03,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=296, Invalid=4051, Unknown=19, NotChecked=2774, Total=7140 [2022-07-20 06:19:03,825 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 58 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:19:03,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1362 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 845 Invalid, 0 Unknown, 667 Unchecked, 0.3s Time] [2022-07-20 06:19:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-20 06:19:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-07-20 06:19:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 06:19:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-07-20 06:19:03,827 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 75 [2022-07-20 06:19:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:19:03,827 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-07-20 06:19:03,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:19:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-07-20 06:19:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 06:19:03,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:19:03,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:19:03,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:19:04,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:04,039 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 06:19:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:19:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1283862180, now seen corresponding path program 1 times [2022-07-20 06:19:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:19:04,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576832756] [2022-07-20 06:19:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:19:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 06:19:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:04,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 06:19:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:19:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:19:04,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576832756] [2022-07-20 06:19:04,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576832756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:19:04,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295430799] [2022-07-20 06:19:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:19:04,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:19:04,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:19:04,882 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:19:04,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 06:19:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:19:05,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-20 06:19:05,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:19:05,251 INFO L390 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 [2022-07-20 06:19:05,460 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:19:05,460 INFO L390 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 11 [2022-07-20 06:19:05,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:19:05,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-20 06:19:05,592 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:19:05,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-20 06:19:05,596 INFO L390 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 18 treesize of output 20 [2022-07-20 06:19:05,719 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 06:19:05,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-07-20 06:19:05,722 INFO L390 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 27 treesize of output 22 [2022-07-20 06:19:05,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:05,772 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:19:05,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-07-20 06:19:05,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:05,776 INFO L390 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 32 treesize of output 34 [2022-07-20 06:19:06,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:06,075 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:19:06,075 INFO L390 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 2 case distinctions, treesize of input 73 treesize of output 57 [2022-07-20 06:19:06,083 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-20 06:19:06,084 INFO L390 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-07-20 06:19:06,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:19:06,209 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:19:06,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-07-20 06:19:06,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 25 [2022-07-20 06:19:06,568 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-07-20 06:19:06,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-07-20 06:19:06,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:06,574 INFO L390 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 15 treesize of output 15 [2022-07-20 06:19:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:19:06,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:19:08,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5396 (Array Int Int)) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5397)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (and (= (select (select .cse1 .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5396) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))))))) is different from false [2022-07-20 06:19:10,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (forall ((v_ArrVal_5396 (Array Int Int))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-20 06:19:13,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5394 Int) (v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5393)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (forall ((v_ArrVal_5396 (Array Int Int))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse3) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (and (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-20 06:19:15,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse3 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) .cse3 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (and (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|))))))) is different from false [2022-07-20 06:19:16,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|))) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse4) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (and (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-07-20 06:19:17,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_5394)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_5393)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (and (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-20 06:19:19,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (and (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int))) (= (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 v_ArrVal_5394)) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 v_ArrVal_5393)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (= (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse4) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) is different from false [2022-07-20 06:19:20,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5393 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_5397 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse1 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5393))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (and (= (select (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_5394 Int) (v_ArrVal_5396 (Array Int Int))) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_5394)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5396) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_5393)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5397) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) is different from false [2022-07-20 06:19:39,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:39,915 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1174 treesize of output 1102 [2022-07-20 06:19:39,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:19:39,949 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1336 treesize of output 832 [2022-07-20 06:19:40,561 INFO L356 Elim1Store]: treesize reduction 165, result has 66.7 percent of original size [2022-07-20 06:19:40,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96272717 treesize of output 94682833 [2022-07-20 06:20:14,450 WARN L233 SmtUtils]: Spent 33.88s on a formula simplification. DAG size of input: 5382 DAG size of output: 5381 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-20 06:20:29,557 WARN L233 SmtUtils]: Spent 10.61s on a formula simplification. DAG size of input: 909 DAG size of output: 241 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-20 06:20:29,558 INFO L356 Elim1Store]: treesize reduction 3062, result has 15.9 percent of original size [2022-07-20 06:20:29,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 32 new quantified variables, introduced 210 case distinctions, treesize of input 9144552820 treesize of output 8156385762