./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.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-ext3-properties/sll_of_sll_nondet_append-1.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 fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:30:12,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:30:12,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:30:12,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:30:13,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:30:13,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:30:13,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:30:13,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:30:13,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:30:13,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:30:13,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:30:13,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:30:13,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:30:13,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:30:13,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:30:13,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:30:13,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:30:13,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:30:13,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:30:13,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:30:13,029 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:30:13,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:30:13,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:30:13,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:30:13,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:30:13,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:30:13,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:30:13,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:30:13,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:30:13,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:30:13,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:30:13,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:30:13,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:30:13,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:30:13,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:30:13,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:30:13,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:30:13,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:30:13,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:30:13,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:30:13,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:30:13,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:30:13,045 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:30:13,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:30:13,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:30:13,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:30:13,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:30:13,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:30:13,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:30:13,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:30:13,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:30:13,072 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:30:13,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:30:13,073 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:30:13,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:30:13,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:30:13,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:30:13,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:30:13,074 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:30:13,074 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:30:13,074 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:30:13,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:30:13,075 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:30:13,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:30:13,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:30:13,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:30:13,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:30:13,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:30:13,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:30:13,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:30:13,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:30:13,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:30:13,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:30:13,077 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2022-07-20 06:30:13,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:30:13,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:30:13,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:30:13,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:30:13,322 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:30:13,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-07-20 06:30:13,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f530ce79/d8f84a103e33470e8566fcd87bd43fac/FLAG5dca0f9d6 [2022-07-20 06:30:13,704 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:30:13,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-07-20 06:30:13,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f530ce79/d8f84a103e33470e8566fcd87bd43fac/FLAG5dca0f9d6 [2022-07-20 06:30:14,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f530ce79/d8f84a103e33470e8566fcd87bd43fac [2022-07-20 06:30:14,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:30:14,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:30:14,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:30:14,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:30:14,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:30:14,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3843adad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14, skipping insertion in model container [2022-07-20 06:30:14,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:30:14,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:30:14,433 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-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-07-20 06:30:14,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:30:14,444 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:30:14,486 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-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-07-20 06:30:14,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:30:14,509 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:30:14,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14 WrapperNode [2022-07-20 06:30:14,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:30:14,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:30:14,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:30:14,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:30:14,517 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:30:14" (1/1) ... [2022-07-20 06:30:14,540 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:30:14" (1/1) ... [2022-07-20 06:30:14,563 INFO L137 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-07-20 06:30:14,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:30:14,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:30:14,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:30:14,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:30:14,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:30:14,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:30:14,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:30:14,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:30:14,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (1/1) ... [2022-07-20 06:30:14,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:30:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:14,621 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:30:14,652 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:30:14,668 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 06:30:14,669 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 06:30:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:30:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:30:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:30:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:30:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:30:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:30:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 06:30:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:30:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:30:14,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:30:14,807 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:30:14,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:30:14,836 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 06:30:15,061 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:30:15,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:30:15,068 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-20 06:30:15,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:30:15 BoogieIcfgContainer [2022-07-20 06:30:15,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:30:15,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:30:15,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:30:15,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:30:15,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:30:14" (1/3) ... [2022-07-20 06:30:15,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ddce07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:30:15, skipping insertion in model container [2022-07-20 06:30:15,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:30:14" (2/3) ... [2022-07-20 06:30:15,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ddce07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:30:15, skipping insertion in model container [2022-07-20 06:30:15,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:30:15" (3/3) ... [2022-07-20 06:30:15,078 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-07-20 06:30:15,091 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:30:15,091 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-20 06:30:15,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:30:15,135 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@1e2dcbaf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@310c2e01 [2022-07-20 06:30:15,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-20 06:30:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-20 06:30:15,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:15,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-20 06:30:15,146 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1083078, now seen corresponding path program 1 times [2022-07-20 06:30:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:15,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752572426] [2022-07-20 06:30:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:15,274 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:30:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752572426] [2022-07-20 06:30:15,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752572426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:15,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:15,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:30:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942027008] [2022-07-20 06:30:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:15,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 06:30:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:15,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 06:30:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 06:30:15,308 INFO L87 Difference]: Start difference. First operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:15,340 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-07-20 06:30:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 06:30:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-20 06:30:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:15,351 INFO L225 Difference]: With dead ends: 117 [2022-07-20 06:30:15,351 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 06:30:15,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 06:30:15,358 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:15,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 06:30:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-20 06:30:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 110 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-07-20 06:30:15,401 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2022-07-20 06:30:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:15,402 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-07-20 06:30:15,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-07-20 06:30:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-20 06:30:15,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:15,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-20 06:30:15,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:30:15,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1079730, now seen corresponding path program 1 times [2022-07-20 06:30:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015388240] [2022-07-20 06:30:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:15,494 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:30:15,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:15,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015388240] [2022-07-20 06:30:15,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015388240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:15,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:15,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:30:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645663417] [2022-07-20 06:30:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:15,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:30:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:30:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:30:15,498 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:15,604 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-07-20 06:30:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:30:15,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-20 06:30:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:15,606 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:30:15,607 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:30:15,608 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:30:15,610 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:15,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:30:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:30:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2022-07-20 06:30:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2022-07-20 06:30:15,625 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 4 [2022-07-20 06:30:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:15,627 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2022-07-20 06:30:15,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2022-07-20 06:30:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-20 06:30:15,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:15,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-20 06:30:15,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:30:15,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:15,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1079731, now seen corresponding path program 1 times [2022-07-20 06:30:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:15,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747076802] [2022-07-20 06:30:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:15,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:15,681 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:30:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:15,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747076802] [2022-07-20 06:30:15,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747076802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:15,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:15,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:30:15,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961832488] [2022-07-20 06:30:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:15,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:30:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:15,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:30:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:30:15,685 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:15,727 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2022-07-20 06:30:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:30:15,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-20 06:30:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:15,730 INFO L225 Difference]: With dead ends: 157 [2022-07-20 06:30:15,730 INFO L226 Difference]: Without dead ends: 157 [2022-07-20 06:30:15,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:30:15,731 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:15,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-20 06:30:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2022-07-20 06:30:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-07-20 06:30:15,742 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2022-07-20 06:30:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:15,742 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-07-20 06:30:15,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-07-20 06:30:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:30:15,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:15,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:15,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:30:15,745 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash -336207078, now seen corresponding path program 1 times [2022-07-20 06:30:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:15,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681462052] [2022-07-20 06:30:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:30:15,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:15,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681462052] [2022-07-20 06:30:15,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681462052] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:30:15,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815375259] [2022-07-20 06:30:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:15,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:15,816 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:30:15,817 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:30:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:15,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:30:15,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:30:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:30:15,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:30:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:30:15,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815375259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:30:15,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:30:15,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-20 06:30:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131307630] [2022-07-20 06:30:15,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:30:15,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:30:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:15,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:30:15,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:30:15,952 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:16,002 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2022-07-20 06:30:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:30:16,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 06:30:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:16,004 INFO L225 Difference]: With dead ends: 244 [2022-07-20 06:30:16,004 INFO L226 Difference]: Without dead ends: 244 [2022-07-20 06:30:16,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:30:16,005 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 319 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:16,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 603 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-20 06:30:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2022-07-20 06:30:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-07-20 06:30:16,014 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2022-07-20 06:30:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:16,015 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-07-20 06:30:16,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-07-20 06:30:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:30:16,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:16,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:16,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:30:16,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:16,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -991177183, now seen corresponding path program 1 times [2022-07-20 06:30:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:16,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454647537] [2022-07-20 06:30:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:16,264 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:30:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454647537] [2022-07-20 06:30:16,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454647537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:16,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:16,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:30:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326022181] [2022-07-20 06:30:16,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:16,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:30:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:16,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:30:16,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:30:16,266 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:16,335 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2022-07-20 06:30:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:30:16,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:30:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:16,336 INFO L225 Difference]: With dead ends: 329 [2022-07-20 06:30:16,336 INFO L226 Difference]: Without dead ends: 329 [2022-07-20 06:30:16,337 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:30:16,337 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:16,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:30:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-20 06:30:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2022-07-20 06:30:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2022-07-20 06:30:16,343 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2022-07-20 06:30:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:16,343 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2022-07-20 06:30:16,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2022-07-20 06:30:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:30:16,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:16,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:16,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:30:16,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash -991177182, now seen corresponding path program 1 times [2022-07-20 06:30:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:16,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950088239] [2022-07-20 06:30:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:16,380 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:30:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:16,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950088239] [2022-07-20 06:30:16,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950088239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:16,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:16,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:30:16,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966817093] [2022-07-20 06:30:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:16,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:30:16,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:30:16,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:30:16,382 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:16,454 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-07-20 06:30:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:30:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:30:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:16,456 INFO L225 Difference]: With dead ends: 330 [2022-07-20 06:30:16,456 INFO L226 Difference]: Without dead ends: 330 [2022-07-20 06:30:16,456 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:30:16,459 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:16,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:30:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-20 06:30:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 171. [2022-07-20 06:30:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2022-07-20 06:30:16,479 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2022-07-20 06:30:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:16,480 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2022-07-20 06:30:16,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2022-07-20 06:30:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:30:16,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:16,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:16,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:30:16,481 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash -661772220, now seen corresponding path program 1 times [2022-07-20 06:30:16,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:16,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248078554] [2022-07-20 06:30:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:16,518 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:30:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:16,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248078554] [2022-07-20 06:30:16,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248078554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:16,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:16,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:30:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900561005] [2022-07-20 06:30:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:30:16,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:30:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:30:16,521 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:16,571 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-07-20 06:30:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:30:16,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 06:30:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:16,573 INFO L225 Difference]: With dead ends: 244 [2022-07-20 06:30:16,573 INFO L226 Difference]: Without dead ends: 244 [2022-07-20 06:30:16,573 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:30:16,574 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:16,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-20 06:30:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 169. [2022-07-20 06:30:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2022-07-20 06:30:16,581 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2022-07-20 06:30:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:16,582 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2022-07-20 06:30:16,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2022-07-20 06:30:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:30:16,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:16,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:16,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:30:16,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash -661772219, now seen corresponding path program 1 times [2022-07-20 06:30:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554813971] [2022-07-20 06:30:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:16,628 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:30:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:16,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554813971] [2022-07-20 06:30:16,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554813971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:16,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:16,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:30:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090764679] [2022-07-20 06:30:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:16,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:30:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:16,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:30:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:30:16,631 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:16,698 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2022-07-20 06:30:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:30:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 06:30:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:16,701 INFO L225 Difference]: With dead ends: 376 [2022-07-20 06:30:16,701 INFO L226 Difference]: Without dead ends: 376 [2022-07-20 06:30:16,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:30:16,702 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 231 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:16,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 812 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-20 06:30:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 172. [2022-07-20 06:30:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2022-07-20 06:30:16,707 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2022-07-20 06:30:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:16,708 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2022-07-20 06:30:16,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2022-07-20 06:30:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:30:16,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:16,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:16,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:30:16,709 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash -51661170, now seen corresponding path program 1 times [2022-07-20 06:30:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:16,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388686725] [2022-07-20 06:30:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:30:16,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:16,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388686725] [2022-07-20 06:30:16,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388686725] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:30:16,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173536779] [2022-07-20 06:30:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:16,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:16,792 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:30:16,793 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:30:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:16,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 06:30:16,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:30:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:30:16,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:30:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:30:16,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173536779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:30:16,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:30:16,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-20 06:30:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936236611] [2022-07-20 06:30:16,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:30:16,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:30:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:16,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:30:16,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:30:16,905 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:16,987 INFO L93 Difference]: Finished difference Result 391 states and 474 transitions. [2022-07-20 06:30:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:30:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:30:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:16,989 INFO L225 Difference]: With dead ends: 391 [2022-07-20 06:30:16,989 INFO L226 Difference]: Without dead ends: 391 [2022-07-20 06:30:16,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:30:16,989 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 477 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:16,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 814 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:30:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-20 06:30:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196. [2022-07-20 06:30:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2022-07-20 06:30:16,993 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2022-07-20 06:30:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:16,993 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2022-07-20 06:30:16,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2022-07-20 06:30:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:30:16,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:16,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-20 06:30:17,011 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:30:17,211 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,SelfDestructingSolverStorable8 [2022-07-20 06:30:17,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1254577850, now seen corresponding path program 2 times [2022-07-20 06:30:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:17,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501924075] [2022-07-20 06:30:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:17,264 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:30:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:17,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501924075] [2022-07-20 06:30:17,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501924075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:17,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:17,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:30:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957129121] [2022-07-20 06:30:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:17,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:30:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:30:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:30:17,266 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:17,311 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-07-20 06:30:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:30:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 06:30:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:17,313 INFO L225 Difference]: With dead ends: 269 [2022-07-20 06:30:17,313 INFO L226 Difference]: Without dead ends: 269 [2022-07-20 06:30:17,313 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:30:17,313 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:17,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-20 06:30:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2022-07-20 06:30:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 232 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-07-20 06:30:17,317 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 19 [2022-07-20 06:30:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:17,318 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-07-20 06:30:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-07-20 06:30:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:30:17,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:17,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:17,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:30:17,322 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1435011604, now seen corresponding path program 1 times [2022-07-20 06:30:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:17,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192457125] [2022-07-20 06:30:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:17,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:17,373 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:30:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:17,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192457125] [2022-07-20 06:30:17,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192457125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:17,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:17,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:30:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150488277] [2022-07-20 06:30:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:17,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:30:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:30:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:30:17,376 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:17,426 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2022-07-20 06:30:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:30:17,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:30:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:17,428 INFO L225 Difference]: With dead ends: 260 [2022-07-20 06:30:17,428 INFO L226 Difference]: Without dead ends: 260 [2022-07-20 06:30:17,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:30:17,429 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:17,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 380 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-20 06:30:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 217. [2022-07-20 06:30:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 216 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2022-07-20 06:30:17,432 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 23 [2022-07-20 06:30:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:17,432 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2022-07-20 06:30:17,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2022-07-20 06:30:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:30:17,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:17,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:17,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:30:17,434 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 877276576, now seen corresponding path program 2 times [2022-07-20 06:30:17,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:17,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165784681] [2022-07-20 06:30:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:30:17,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:17,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165784681] [2022-07-20 06:30:17,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165784681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:30:17,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036758185] [2022-07-20 06:30:17,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:30:17,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:17,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:17,508 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:30:17,509 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:30:17,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:30:17,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:30:17,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:30:17,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:30:17,604 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:30:17,609 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:30:17,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:17,633 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 12 treesize of output 14 [2022-07-20 06:30:17,645 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:30:17,645 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:30:17,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:17,666 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 12 treesize of output 14 [2022-07-20 06:30:17,671 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:30:17,672 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:30:17,697 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:30:17,698 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:30:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 06:30:17,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:30:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:30:18,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036758185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:30:18,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:30:18,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2022-07-20 06:30:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509110604] [2022-07-20 06:30:18,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:30:18,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:30:18,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:18,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:30:18,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:30:18,194 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:18,279 INFO L93 Difference]: Finished difference Result 272 states and 330 transitions. [2022-07-20 06:30:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:30:18,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 06:30:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:18,281 INFO L225 Difference]: With dead ends: 272 [2022-07-20 06:30:18,281 INFO L226 Difference]: Without dead ends: 272 [2022-07-20 06:30:18,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:30:18,282 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 480 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:18,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 262 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-20 06:30:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-20 06:30:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2022-07-20 06:30:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.4917127071823204) internal successors, (270), 214 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-07-20 06:30:18,285 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 24 [2022-07-20 06:30:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:18,285 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-07-20 06:30:18,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-07-20 06:30:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:30:18,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:18,286 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:18,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:30:18,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:18,503 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:18,503 INFO L85 PathProgramCache]: Analyzing trace with hash 361607171, now seen corresponding path program 1 times [2022-07-20 06:30:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:18,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228954807] [2022-07-20 06:30:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:18,562 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:30:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:18,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228954807] [2022-07-20 06:30:18,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228954807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:18,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:18,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:30:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070799291] [2022-07-20 06:30:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:18,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:30:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:30:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:30:18,565 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:18,634 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2022-07-20 06:30:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:30:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:30:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:18,636 INFO L225 Difference]: With dead ends: 233 [2022-07-20 06:30:18,636 INFO L226 Difference]: Without dead ends: 233 [2022-07-20 06:30:18,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:30:18,637 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:18,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 407 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-20 06:30:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2022-07-20 06:30:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 216 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2022-07-20 06:30:18,642 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 25 [2022-07-20 06:30:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:18,642 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2022-07-20 06:30:18,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2022-07-20 06:30:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:30:18,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:18,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:18,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:30:18,643 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1675080075, now seen corresponding path program 1 times [2022-07-20 06:30:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:18,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782567942] [2022-07-20 06:30:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:18,675 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:30:18,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:18,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782567942] [2022-07-20 06:30:18,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782567942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:18,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:18,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:30:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247058537] [2022-07-20 06:30:18,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:18,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:30:18,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:30:18,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:30:18,678 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:18,734 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2022-07-20 06:30:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:30:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:30:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:18,736 INFO L225 Difference]: With dead ends: 219 [2022-07-20 06:30:18,736 INFO L226 Difference]: Without dead ends: 211 [2022-07-20 06:30:18,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:30:18,737 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:18,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:30:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-20 06:30:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-07-20 06:30:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.502857142857143) internal successors, (263), 208 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2022-07-20 06:30:18,740 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 26 [2022-07-20 06:30:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:18,740 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2022-07-20 06:30:18,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2022-07-20 06:30:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:30:18,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:18,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:18,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:30:18,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:18,741 INFO L85 PathProgramCache]: Analyzing trace with hash -981051253, now seen corresponding path program 1 times [2022-07-20 06:30:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:18,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252149677] [2022-07-20 06:30:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 06:30:18,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:18,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252149677] [2022-07-20 06:30:18,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252149677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:18,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:18,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:30:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647117318] [2022-07-20 06:30:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:18,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:30:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:30:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:30:18,780 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:18,862 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2022-07-20 06:30:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:30:18,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:30:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:18,863 INFO L225 Difference]: With dead ends: 235 [2022-07-20 06:30:18,863 INFO L226 Difference]: Without dead ends: 235 [2022-07-20 06:30:18,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:30:18,864 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:18,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 169 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-20 06:30:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 208. [2022-07-20 06:30:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 207 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2022-07-20 06:30:18,867 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 29 [2022-07-20 06:30:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:18,867 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2022-07-20 06:30:18,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2022-07-20 06:30:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:30:18,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:18,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:30:18,868 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash -981051252, now seen corresponding path program 1 times [2022-07-20 06:30:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:18,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576366356] [2022-07-20 06:30:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 06:30:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:18,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576366356] [2022-07-20 06:30:18,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576366356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:18,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:30:18,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:30:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726305448] [2022-07-20 06:30:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:18,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:30:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:18,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:30:18,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:30:18,942 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:18,993 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2022-07-20 06:30:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:30:18,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:30:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:18,994 INFO L225 Difference]: With dead ends: 207 [2022-07-20 06:30:18,994 INFO L226 Difference]: Without dead ends: 207 [2022-07-20 06:30:18,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:30:18,994 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 305 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:18,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 126 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-20 06:30:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-20 06:30:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 206 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2022-07-20 06:30:18,997 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 29 [2022-07-20 06:30:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:18,997 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2022-07-20 06:30:18,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2022-07-20 06:30:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:30:18,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:18,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:18,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:30:18,998 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:18,998 INFO L85 PathProgramCache]: Analyzing trace with hash -347817722, now seen corresponding path program 1 times [2022-07-20 06:30:18,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:18,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862885712] [2022-07-20 06:30:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:30:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:19,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862885712] [2022-07-20 06:30:19,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862885712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:30:19,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96403366] [2022-07-20 06:30:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:19,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:19,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:19,087 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:30:19,088 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:30:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:19,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 06:30:19,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:30:19,174 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:30:19,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:19,199 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 12 treesize of output 14 [2022-07-20 06:30:19,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:19,221 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 12 treesize of output 14 [2022-07-20 06:30:19,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:19,247 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 12 treesize of output 14 [2022-07-20 06:30:19,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:19,267 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 12 treesize of output 14 [2022-07-20 06:30:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:30:19,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:30:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:30:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96403366] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:30:19,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:30:19,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-20 06:30:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946279660] [2022-07-20 06:30:19,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:30:19,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:30:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:30:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:30:19,857 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:19,951 INFO L93 Difference]: Finished difference Result 395 states and 483 transitions. [2022-07-20 06:30:19,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:30:19,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 06:30:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:19,953 INFO L225 Difference]: With dead ends: 395 [2022-07-20 06:30:19,953 INFO L226 Difference]: Without dead ends: 395 [2022-07-20 06:30:19,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:30:19,953 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 403 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:19,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 404 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2022-07-20 06:30:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-20 06:30:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 278. [2022-07-20 06:30:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 277 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 332 transitions. [2022-07-20 06:30:19,956 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 332 transitions. Word has length 30 [2022-07-20 06:30:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:19,957 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 332 transitions. [2022-07-20 06:30:19,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 332 transitions. [2022-07-20 06:30:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:30:19,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:19,957 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:19,989 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:30:20,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 06:30:20,173 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash -347817723, now seen corresponding path program 1 times [2022-07-20 06:30:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:20,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492241043] [2022-07-20 06:30:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:30:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492241043] [2022-07-20 06:30:20,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492241043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:30:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741429060] [2022-07-20 06:30:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:20,268 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:30:20,269 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:30:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:20,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 06:30:20,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:30:20,356 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:30:20,378 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:30:20,378 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:30:20,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:20,406 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 16 treesize of output 18 [2022-07-20 06:30:20,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:20,426 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 16 treesize of output 18 [2022-07-20 06:30:20,454 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:30:20,454 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 16 treesize of output 22 [2022-07-20 06:30:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:30:20,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:30:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:30:20,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741429060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:30:20,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:30:20,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-07-20 06:30:20,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440228669] [2022-07-20 06:30:20,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:30:20,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:30:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:30:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:30:20,758 INFO L87 Difference]: Start difference. First operand 278 states and 332 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:20,897 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2022-07-20 06:30:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:30:20,897 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 06:30:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:20,898 INFO L225 Difference]: With dead ends: 303 [2022-07-20 06:30:20,898 INFO L226 Difference]: Without dead ends: 303 [2022-07-20 06:30:20,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:30:20,899 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 775 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:20,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 285 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-07-20 06:30:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-20 06:30:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 276. [2022-07-20 06:30:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.3076923076923077) internal successors, (323), 275 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 323 transitions. [2022-07-20 06:30:20,902 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 323 transitions. Word has length 30 [2022-07-20 06:30:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:20,902 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 323 transitions. [2022-07-20 06:30:20,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 323 transitions. [2022-07-20 06:30:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:30:20,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:20,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:20,943 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:30:21,115 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,SelfDestructingSolverStorable17 [2022-07-20 06:30:21,116 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:30:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1918350099, now seen corresponding path program 1 times [2022-07-20 06:30:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:21,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154272891] [2022-07-20 06:30:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:30:21,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:21,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154272891] [2022-07-20 06:30:21,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154272891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:30:21,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081220411] [2022-07-20 06:30:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:21,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:21,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:21,318 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:30:21,319 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:30:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:21,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-20 06:30:21,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:30:21,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,512 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:30:21,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,515 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:30:21,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,594 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:30:21,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,597 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 19 treesize of output 18 [2022-07-20 06:30:21,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,683 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:30:21,683 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 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-20 06:30:21,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,689 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:30:21,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,731 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:30:21,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,734 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:30:21,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,756 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:30:21,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,761 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:30:21,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,801 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:30:21,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:30:21,804 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:30:21,839 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 15 treesize of output 7 [2022-07-20 06:30:21,841 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 15 treesize of output 7 [2022-07-20 06:30:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:30:21,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:30:21,856 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-07-20 06:30:21,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) is different from false [2022-07-20 06:30:21,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:30:21,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:30:21,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:30:22,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:30:24,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:30:24,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_495 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:30:24,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:30:24,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:30:24,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:30:24,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:30:25,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:30:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-20 06:30:25,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081220411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:30:25,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:30:25,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 18] total 37 [2022-07-20 06:30:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908765308] [2022-07-20 06:30:25,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:30:25,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 06:30:25,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:25,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 06:30:25,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=451, Unknown=13, NotChecked=728, Total=1332 [2022-07-20 06:30:25,403 INFO L87 Difference]: Start difference. First operand 276 states and 323 transitions. Second operand has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:27,408 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-20 06:30:29,413 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) is different from false [2022-07-20 06:30:29,420 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:30:31,424 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:30:33,430 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:30:35,490 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_495 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:30:37,496 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:30:39,501 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:31:39,616 WARN L233 SmtUtils]: Spent 42.04s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:32:39,699 WARN L233 SmtUtils]: Spent 42.06s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:33:39,819 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|)) is different from false [2022-07-20 06:33:41,824 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< (+ |c_ULTIMATE.start_node_create_with_sublist_#res#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|)) is different from false [2022-07-20 06:33:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:47,957 INFO L93 Difference]: Finished difference Result 313 states and 362 transitions. [2022-07-20 06:33:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:33:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 06:33:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:47,958 INFO L225 Difference]: With dead ends: 313 [2022-07-20 06:33:47,958 INFO L226 Difference]: Without dead ends: 313 [2022-07-20 06:33:47,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 204.8s TimeCoverageRelationStatistics Valid=209, Invalid=651, Unknown=44, NotChecked=1748, Total=2652 [2022-07-20 06:33:47,959 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 12 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:47,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1603 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 442 Unchecked, 0.1s Time] [2022-07-20 06:33:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-20 06:33:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2022-07-20 06:33:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 274 states have (on average 1.2846715328467153) internal successors, (352), 302 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2022-07-20 06:33:47,963 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 33 [2022-07-20 06:33:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:47,964 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2022-07-20 06:33:47,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2022-07-20 06:33:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:33:47,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:47,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:47,985 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:33:48,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:33:48,175 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:33:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -990413803, now seen corresponding path program 1 times [2022-07-20 06:33:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:48,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348983399] [2022-07-20 06:33:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 06:33:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:48,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348983399] [2022-07-20 06:33:48,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348983399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:48,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:48,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:33:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729118795] [2022-07-20 06:33:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:48,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:48,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:48,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:48,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:48,204 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:48,211 INFO L93 Difference]: Finished difference Result 284 states and 331 transitions. [2022-07-20 06:33:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 06:33:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:48,213 INFO L225 Difference]: With dead ends: 284 [2022-07-20 06:33:48,213 INFO L226 Difference]: Without dead ends: 284 [2022-07-20 06:33:48,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:33:48,217 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:48,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-20 06:33:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2022-07-20 06:33:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 254 states have (on average 1.2992125984251968) internal successors, (330), 282 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 330 transitions. [2022-07-20 06:33:48,226 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 330 transitions. Word has length 33 [2022-07-20 06:33:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:48,227 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 330 transitions. [2022-07-20 06:33:48,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 330 transitions. [2022-07-20 06:33:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:33:48,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:48,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:48,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:33:48,228 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:33:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash 74446604, now seen corresponding path program 1 times [2022-07-20 06:33:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:48,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375404534] [2022-07-20 06:33:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:48,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:48,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375404534] [2022-07-20 06:33:48,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375404534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:33:48,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130183807] [2022-07-20 06:33:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:48,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:33:48,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:33:48,311 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:33:48,312 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:33:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:48,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:33:48,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:48,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:33:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:48,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130183807] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:33:48,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:33:48,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-07-20 06:33:48,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695829314] [2022-07-20 06:33:48,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:33:48,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:33:48,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:33:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:33:48,496 INFO L87 Difference]: Start difference. First operand 283 states and 330 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:48,627 INFO L93 Difference]: Finished difference Result 502 states and 569 transitions. [2022-07-20 06:33:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:33:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:33:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:48,629 INFO L225 Difference]: With dead ends: 502 [2022-07-20 06:33:48,629 INFO L226 Difference]: Without dead ends: 502 [2022-07-20 06:33:48,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:33:48,630 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 264 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:48,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1334 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:33:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-07-20 06:33:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 317. [2022-07-20 06:33:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 288 states have (on average 1.3090277777777777) internal successors, (377), 316 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 377 transitions. [2022-07-20 06:33:48,643 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 377 transitions. Word has length 38 [2022-07-20 06:33:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:48,643 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 377 transitions. [2022-07-20 06:33:48,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 377 transitions. [2022-07-20 06:33:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:33:48,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:48,644 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:48,664 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:33:48,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:33:48,862 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:33:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1481327645, now seen corresponding path program 2 times [2022-07-20 06:33:48,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:48,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253403308] [2022-07-20 06:33:48,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:33:49,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:49,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253403308] [2022-07-20 06:33:49,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253403308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:33:49,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524222933] [2022-07-20 06:33:49,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:33:49,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:33:49,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:33:49,144 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:33:49,145 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:33:49,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:33:49,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:33:49,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 06:33:49,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:49,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,399 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:33:49,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,403 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:33:49,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,511 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 19 treesize of output 18 [2022-07-20 06:33:49,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,515 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:33:49,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,673 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:33:49,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,685 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 06:33:49,686 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 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-20 06:33:49,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,809 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:33:49,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,824 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:33:49,824 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 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-20 06:33:49,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,878 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:33:49,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,884 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:33:49,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,907 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:33:49,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:49,913 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:33:50,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:50,007 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:33:50,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:33:50,011 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:33:50,030 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 15 treesize of output 7 [2022-07-20 06:33:50,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 15 treesize of output 7 [2022-07-20 06:33:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 06:33:50,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:33:50,048 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-07-20 06:33:50,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) is different from false [2022-07-20 06:33:50,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))) is different from false [2022-07-20 06:33:50,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:50,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:50,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:52,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) is different from false [2022-07-20 06:33:52,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:52,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))) is different from false [2022-07-20 06:33:52,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:52,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:52,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:53,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:53,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-20 06:33:53,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:33:53,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:33:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2022-07-20 06:33:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524222933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:33:55,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:33:55,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 21] total 43 [2022-07-20 06:33:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144370787] [2022-07-20 06:33:55,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:33:55,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-20 06:33:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-20 06:33:55,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=566, Unknown=16, NotChecked=1040, Total=1806 [2022-07-20 06:33:55,491 INFO L87 Difference]: Start difference. First operand 317 states and 377 transitions. Second operand has 43 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:57,512 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-20 06:33:59,518 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:33:59,544 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:34:01,553 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:34:03,568 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:34:05,607 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:34:07,622 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:34:07,686 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:34:09,743 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:34:11,749 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:34:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:11,889 INFO L93 Difference]: Finished difference Result 399 states and 465 transitions. [2022-07-20 06:34:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:34:11,890 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:34:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:11,892 INFO L225 Difference]: With dead ends: 399 [2022-07-20 06:34:11,892 INFO L226 Difference]: Without dead ends: 399 [2022-07-20 06:34:11,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 26 IntricatePredicates, 1 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=252, Invalid=756, Unknown=26, NotChecked=2158, Total=3192 [2022-07-20 06:34:11,893 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 553 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:11,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1618 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 553 Unchecked, 0.1s Time] [2022-07-20 06:34:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-07-20 06:34:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 387. [2022-07-20 06:34:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 358 states have (on average 1.26536312849162) internal successors, (453), 386 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 453 transitions. [2022-07-20 06:34:11,898 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 453 transitions. Word has length 42 [2022-07-20 06:34:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:11,898 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 453 transitions. [2022-07-20 06:34:11,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 453 transitions. [2022-07-20 06:34:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:34:11,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:11,898 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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:34:11,928 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:34:12,115 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,SelfDestructingSolverStorable21 [2022-07-20 06:34:12,115 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1784280353, now seen corresponding path program 1 times [2022-07-20 06:34:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:12,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841861936] [2022-07-20 06:34:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 06:34:12,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:12,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841861936] [2022-07-20 06:34:12,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841861936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:12,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:34:12,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:34:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879084249] [2022-07-20 06:34:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:12,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:34:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:12,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:34:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:34:12,152 INFO L87 Difference]: Start difference. First operand 387 states and 453 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:12,169 INFO L93 Difference]: Finished difference Result 497 states and 591 transitions. [2022-07-20 06:34:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:34:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:34:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:12,171 INFO L225 Difference]: With dead ends: 497 [2022-07-20 06:34:12,171 INFO L226 Difference]: Without dead ends: 497 [2022-07-20 06:34:12,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:34:12,172 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 105 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:12,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 349 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:34:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-07-20 06:34:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 323. [2022-07-20 06:34:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 294 states have (on average 1.2925170068027212) internal successors, (380), 322 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 380 transitions. [2022-07-20 06:34:12,176 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 380 transitions. Word has length 42 [2022-07-20 06:34:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:12,176 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 380 transitions. [2022-07-20 06:34:12,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 380 transitions. [2022-07-20 06:34:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:34:12,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:12,177 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:12,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:34:12,177 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -788824226, now seen corresponding path program 1 times [2022-07-20 06:34:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:12,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569212435] [2022-07-20 06:34:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:12,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:34:12,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:12,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569212435] [2022-07-20 06:34:12,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569212435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:34:12,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227668613] [2022-07-20 06:34:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:12,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:12,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:34:12,305 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:34:12,323 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:34:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:12,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 06:34:12,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:34:12,445 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:34:12,450 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:34:12,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:34:12,485 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 12 treesize of output 14 [2022-07-20 06:34:12,497 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:34:12,498 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:34:12,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:34:12,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:34:12,553 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:34:12,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:34:12,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:34:12,587 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 12 treesize of output 14 [2022-07-20 06:34:12,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:34:12,607 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 12 treesize of output 14 [2022-07-20 06:34:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:34:12,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:34:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:34:13,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227668613] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:34:13,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:34:13,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-07-20 06:34:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574843811] [2022-07-20 06:34:13,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:34:13,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:34:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:34:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:34:13,408 INFO L87 Difference]: Start difference. First operand 323 states and 380 transitions. Second operand has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:13,540 INFO L93 Difference]: Finished difference Result 347 states and 404 transitions. [2022-07-20 06:34:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:34:13,541 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-20 06:34:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:13,542 INFO L225 Difference]: With dead ends: 347 [2022-07-20 06:34:13,542 INFO L226 Difference]: Without dead ends: 347 [2022-07-20 06:34:13,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:34:13,542 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 735 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:13,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 158 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-07-20 06:34:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-20 06:34:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2022-07-20 06:34:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 294 states have (on average 1.2755102040816326) internal successors, (375), 319 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 375 transitions. [2022-07-20 06:34:13,546 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 375 transitions. Word has length 51 [2022-07-20 06:34:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:13,546 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 375 transitions. [2022-07-20 06:34:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.076923076923077) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 375 transitions. [2022-07-20 06:34:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:34:13,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:13,546 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:13,568 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:34:13,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 06:34:13,759 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash -563101512, now seen corresponding path program 1 times [2022-07-20 06:34:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675591455] [2022-07-20 06:34:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-20 06:34:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:13,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675591455] [2022-07-20 06:34:13,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675591455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:13,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:34:13,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:34:13,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38858079] [2022-07-20 06:34:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:13,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:34:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:13,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:34:13,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:34:13,807 INFO L87 Difference]: Start difference. First operand 320 states and 375 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:13,831 INFO L93 Difference]: Finished difference Result 380 states and 433 transitions. [2022-07-20 06:34:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:34:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-20 06:34:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:13,832 INFO L225 Difference]: With dead ends: 380 [2022-07-20 06:34:13,833 INFO L226 Difference]: Without dead ends: 380 [2022-07-20 06:34:13,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:34:13,834 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 248 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:13,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 188 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:34:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-07-20 06:34:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 318. [2022-07-20 06:34:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 292 states have (on average 1.2705479452054795) internal successors, (371), 317 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 371 transitions. [2022-07-20 06:34:13,838 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 371 transitions. Word has length 55 [2022-07-20 06:34:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:13,839 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 371 transitions. [2022-07-20 06:34:13,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 371 transitions. [2022-07-20 06:34:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 06:34:13,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:13,844 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:13,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 06:34:13,845 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -276278871, now seen corresponding path program 1 times [2022-07-20 06:34:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:13,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93283996] [2022-07-20 06:34:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 06:34:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93283996] [2022-07-20 06:34:13,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93283996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:13,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:34:13,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:34:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646303769] [2022-07-20 06:34:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:13,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:34:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:34:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:34:13,930 INFO L87 Difference]: Start difference. First operand 318 states and 371 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:14,147 INFO L93 Difference]: Finished difference Result 536 states and 627 transitions. [2022-07-20 06:34:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:34:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-20 06:34:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:14,149 INFO L225 Difference]: With dead ends: 536 [2022-07-20 06:34:14,149 INFO L226 Difference]: Without dead ends: 536 [2022-07-20 06:34:14,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:34:14,149 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 935 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:14,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 404 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:34:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-07-20 06:34:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 353. [2022-07-20 06:34:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 328 states have (on average 1.271341463414634) internal successors, (417), 352 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 417 transitions. [2022-07-20 06:34:14,158 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 417 transitions. Word has length 56 [2022-07-20 06:34:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:14,158 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 417 transitions. [2022-07-20 06:34:14,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 417 transitions. [2022-07-20 06:34:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-20 06:34:14,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:14,160 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:14,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 06:34:14,160 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:14,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash -276278870, now seen corresponding path program 1 times [2022-07-20 06:34:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:14,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335179673] [2022-07-20 06:34:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 06:34:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:14,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335179673] [2022-07-20 06:34:14,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335179673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:14,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:34:14,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:34:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920732300] [2022-07-20 06:34:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:14,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:34:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:34:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:34:14,265 INFO L87 Difference]: Start difference. First operand 353 states and 417 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:14,487 INFO L93 Difference]: Finished difference Result 517 states and 619 transitions. [2022-07-20 06:34:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:34:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-20 06:34:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:14,489 INFO L225 Difference]: With dead ends: 517 [2022-07-20 06:34:14,489 INFO L226 Difference]: Without dead ends: 517 [2022-07-20 06:34:14,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:34:14,490 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 822 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:14,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 347 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:34:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-20 06:34:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 386. [2022-07-20 06:34:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 361 states have (on average 1.293628808864266) internal successors, (467), 385 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 467 transitions. [2022-07-20 06:34:14,495 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 467 transitions. Word has length 56 [2022-07-20 06:34:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:14,495 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 467 transitions. [2022-07-20 06:34:14,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 467 transitions. [2022-07-20 06:34:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 06:34:14,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:14,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:14,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 06:34:14,496 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 25284007, now seen corresponding path program 1 times [2022-07-20 06:34:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:14,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005166942] [2022-07-20 06:34:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-20 06:34:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:14,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005166942] [2022-07-20 06:34:14,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005166942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:14,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:34:14,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:34:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195115274] [2022-07-20 06:34:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:14,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:34:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:14,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:34:14,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:34:14,553 INFO L87 Difference]: Start difference. First operand 386 states and 467 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:14,659 INFO L93 Difference]: Finished difference Result 436 states and 535 transitions. [2022-07-20 06:34:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:34:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-20 06:34:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:14,661 INFO L225 Difference]: With dead ends: 436 [2022-07-20 06:34:14,661 INFO L226 Difference]: Without dead ends: 436 [2022-07-20 06:34:14,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:34:14,662 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:14,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 507 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:34:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-07-20 06:34:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 424. [2022-07-20 06:34:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 399 states have (on average 1.3208020050125313) internal successors, (527), 423 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 527 transitions. [2022-07-20 06:34:14,667 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 527 transitions. Word has length 57 [2022-07-20 06:34:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:14,667 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 527 transitions. [2022-07-20 06:34:14,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 527 transitions. [2022-07-20 06:34:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 06:34:14,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:14,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:14,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 06:34:14,668 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash 783803729, now seen corresponding path program 1 times [2022-07-20 06:34:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:14,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510255198] [2022-07-20 06:34:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 06:34:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510255198] [2022-07-20 06:34:14,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510255198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:14,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:34:14,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:34:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735897674] [2022-07-20 06:34:14,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:14,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:34:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:34:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:34:14,733 INFO L87 Difference]: Start difference. First operand 424 states and 527 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:14,858 INFO L93 Difference]: Finished difference Result 522 states and 640 transitions. [2022-07-20 06:34:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:34:14,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-20 06:34:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:14,860 INFO L225 Difference]: With dead ends: 522 [2022-07-20 06:34:14,860 INFO L226 Difference]: Without dead ends: 522 [2022-07-20 06:34:14,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:34:14,861 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 654 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:14,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 408 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:34:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-07-20 06:34:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 424. [2022-07-20 06:34:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 399 states have (on average 1.3082706766917294) internal successors, (522), 423 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 522 transitions. [2022-07-20 06:34:14,866 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 522 transitions. Word has length 58 [2022-07-20 06:34:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:14,866 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 522 transitions. [2022-07-20 06:34:14,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 522 transitions. [2022-07-20 06:34:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:34:14,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:14,867 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:14,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 06:34:14,867 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-20 06:34:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1466385390, now seen corresponding path program 1 times [2022-07-20 06:34:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:14,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789970956] [2022-07-20 06:34:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-20 06:34:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789970956] [2022-07-20 06:34:15,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789970956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:34:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901473483] [2022-07-20 06:34:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:15,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:15,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:34:15,143 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:34:15,192 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:34:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:15,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-20 06:34:15,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:34:15,303 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:34:15,333 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:34:15,333 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:34:15,415 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:34:15,557 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 13 treesize of output 9 [2022-07-20 06:34:15,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:34:15,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:34:15,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:34:15,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, 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:34:15,749 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 28 treesize of output 30 [2022-07-20 06:34:15,753 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 22 [2022-07-20 06:34:16,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:34:16,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:34:16,090 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-20 06:34:16,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 42 [2022-07-20 06:34:16,095 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:34:16,095 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-07-20 06:34:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:34:16,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:34:16,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:16,446 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 1486 treesize of output 1469