./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:29:55,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:29:55,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:29:55,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:29:55,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:29:55,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:29:55,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:29:55,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:29:55,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:29:55,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:29:55,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:29:55,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:29:55,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:29:55,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:29:55,517 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:29:55,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:29:55,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:29:55,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:29:55,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:29:55,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:29:55,518 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:29:55,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:29:55,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:29:55,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:29:55,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:29:55,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:29:55,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:29:55,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:29:55,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:29:55,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:29:55,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:29:55,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:29:55,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:29:55,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:55,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:29:55,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:29:55,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:29:55,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:29:55,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:29:55,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:29:55,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:29:55,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:29:55,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-11-07 16:29:55,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:29:55,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:29:55,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:29:55,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:29:55,815 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:29:55,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-07 16:29:57,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:29:57,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:29:57,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-07 16:29:57,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3045e6d7/68f425923ca5442f9c7c778de2e3cf56/FLAG7e2e882df [2024-11-07 16:29:57,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3045e6d7/68f425923ca5442f9c7c778de2e3cf56 [2024-11-07 16:29:57,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:29:57,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:29:57,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:57,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:29:57,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:29:57,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165239df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57, skipping insertion in model container [2024-11-07 16:29:57,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:29:57,707 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:29:57,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:57,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:29:57,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:29:57,815 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:29:57,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57 WrapperNode [2024-11-07 16:29:57,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:29:57,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:57,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:29:57,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:29:57,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,865 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-11-07 16:29:57,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:29:57,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:29:57,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:29:57,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:29:57,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,899 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-07 16:29:57,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:29:57,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:29:57,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:29:57,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:29:57,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (1/1) ... [2024-11-07 16:29:57,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:29:57,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:29:57,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:29:57,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:29:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:29:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 16:29:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:29:57,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:29:58,069 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:29:58,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:29:58,383 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-07 16:29:58,383 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:29:58,395 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:29:58,396 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 16:29:58,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:58 BoogieIcfgContainer [2024-11-07 16:29:58,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:29:58,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:29:58,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:29:58,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:29:58,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:29:57" (1/3) ... [2024-11-07 16:29:58,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510bb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:58, skipping insertion in model container [2024-11-07 16:29:58,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:29:57" (2/3) ... [2024-11-07 16:29:58,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510bb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:29:58, skipping insertion in model container [2024-11-07 16:29:58,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:29:58" (3/3) ... [2024-11-07 16:29:58,406 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-11-07 16:29:58,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:29:58,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-07 16:29:58,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:29:58,472 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34a82246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:29:58,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-07 16:29:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 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) [2024-11-07 16:29:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:29:58,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:58,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:29:58,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:29:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-07 16:29:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593927577] [2024-11-07 16:29:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:58,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:58,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593927577] [2024-11-07 16:29:58,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593927577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:58,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:58,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:58,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152869384] [2024-11-07 16:29:58,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:58,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:58,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:58,764 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 states have internal predecessors, (112), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2024-11-07 16:29:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:58,931 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2024-11-07 16:29:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:58,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2024-11-07 16:29:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:58,939 INFO L225 Difference]: With dead ends: 106 [2024-11-07 16:29:58,939 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:29:58,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:58,942 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:58,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:29:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-11-07 16:29:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 97 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) [2024-11-07 16:29:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-07 16:29:58,975 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 4 [2024-11-07 16:29:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:58,975 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-07 16:29:58,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2024-11-07 16:29:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-07 16:29:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 16:29:58,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:58,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 16:29:58,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:29:58,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:29:58,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-07 16:29:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50971042] [2024-11-07 16:29:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50971042] [2024-11-07 16:29:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50971042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:29:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520387011] [2024-11-07 16:29:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:29:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:29:59,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:29:59,196 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2024-11-07 16:29:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:59,402 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-11-07 16:29:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:29:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2024-11-07 16:29:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:59,404 INFO L225 Difference]: With dead ends: 137 [2024-11-07 16:29:59,404 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 16:29:59,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:29:59,405 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:59,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:29:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 16:29:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2024-11-07 16:29:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 106 states have internal predecessors, (120), 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) [2024-11-07 16:29:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-11-07 16:29:59,417 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 4 [2024-11-07 16:29:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:59,417 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-11-07 16:29:59,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2024-11-07 16:29:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-11-07 16:29:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:29:59,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:59,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:29:59,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:29:59,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:29:59,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-07 16:29:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:59,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864415804] [2024-11-07 16:29:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:59,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:59,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864415804] [2024-11-07 16:29:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864415804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250295481] [2024-11-07 16:29:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:59,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:59,468 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-07 16:29:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:59,542 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-07 16:29:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:59,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-07 16:29:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:59,544 INFO L225 Difference]: With dead ends: 105 [2024-11-07 16:29:59,544 INFO L226 Difference]: Without dead ends: 105 [2024-11-07 16:29:59,544 INFO L431 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 [2024-11-07 16:29:59,545 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:59,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-07 16:29:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-07 16:29:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 104 states have internal predecessors, (118), 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) [2024-11-07 16:29:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-07 16:29:59,550 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 5 [2024-11-07 16:29:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:59,550 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-07 16:29:59,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-07 16:29:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-07 16:29:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:29:59,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:59,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:29:59,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:29:59,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:29:59,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-07 16:29:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273554692] [2024-11-07 16:29:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273554692] [2024-11-07 16:29:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273554692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341780985] [2024-11-07 16:29:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:59,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:59,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:59,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:59,607 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-07 16:29:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:59,667 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-07 16:29:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:59,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-07 16:29:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:59,669 INFO L225 Difference]: With dead ends: 103 [2024-11-07 16:29:59,669 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 16:29:59,669 INFO L431 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 [2024-11-07 16:29:59,670 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:59,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 16:29:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 16:29:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 102 states have internal predecessors, (116), 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) [2024-11-07 16:29:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-07 16:29:59,675 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-11-07 16:29:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:59,675 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-07 16:29:59,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-07 16:29:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-07 16:29:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:29:59,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:59,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:59,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:29:59,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:29:59,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 234240077, now seen corresponding path program 1 times [2024-11-07 16:29:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:59,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030081394] [2024-11-07 16:29:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030081394] [2024-11-07 16:29:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030081394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:59,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:59,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:59,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653699136] [2024-11-07 16:29:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:59,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:59,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:59,738 INFO L87 Difference]: Start difference. First operand 103 states and 116 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) [2024-11-07 16:29:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:59,801 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-07 16:29:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:59,801 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 9 [2024-11-07 16:29:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:59,802 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:29:59,802 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:29:59,803 INFO L431 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 [2024-11-07 16:29:59,803 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:59,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 117 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:29:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 16:29:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 98 states have internal predecessors, (112), 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) [2024-11-07 16:29:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-07 16:29:59,809 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 9 [2024-11-07 16:29:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:59,809 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-07 16:29:59,809 INFO L472 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) [2024-11-07 16:29:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-07 16:29:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:29:59,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:59,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:59,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:29:59,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:29:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 234240078, now seen corresponding path program 1 times [2024-11-07 16:29:59,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:59,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193581867] [2024-11-07 16:29:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:59,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:29:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:29:59,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193581867] [2024-11-07 16:29:59,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193581867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:29:59,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:29:59,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:29:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468140690] [2024-11-07 16:29:59,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:29:59,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:29:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:29:59,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:29:59,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:29:59,899 INFO L87 Difference]: Start difference. First operand 99 states and 112 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) [2024-11-07 16:29:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:59,952 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-07 16:29:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:29:59,952 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 9 [2024-11-07 16:29:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:59,953 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:29:59,953 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:29:59,953 INFO L431 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 [2024-11-07 16:29:59,954 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:59,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:29:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:29:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 16:29:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 94 states have internal predecessors, (108), 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) [2024-11-07 16:29:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-07 16:29:59,959 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 9 [2024-11-07 16:29:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:59,959 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-07 16:29:59,959 INFO L472 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) [2024-11-07 16:29:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-07 16:29:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:29:59,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:59,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:29:59,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:29:59,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2024-11-07 16:29:59,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:29:59,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794650793] [2024-11-07 16:29:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:29:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:00,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794650793] [2024-11-07 16:30:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794650793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:30:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603276409] [2024-11-07 16:30:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:30:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:30:00,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:30:00,136 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-11-07 16:30:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:00,262 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-07 16:30:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:30:00,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-11-07 16:30:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:00,263 INFO L225 Difference]: With dead ends: 104 [2024-11-07 16:30:00,263 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 16:30:00,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:00,264 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:00,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 16:30:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-11-07 16:30:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 98 states have internal predecessors, (114), 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) [2024-11-07 16:30:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-07 16:30:00,274 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 14 [2024-11-07 16:30:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:00,275 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-07 16:30:00,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-11-07 16:30:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-07 16:30:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:30:00,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:00,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:00,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:30:00,276 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:00,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2024-11-07 16:30:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:00,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796864528] [2024-11-07 16:30:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:00,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:00,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796864528] [2024-11-07 16:30:00,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796864528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:00,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:00,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:00,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863940411] [2024-11-07 16:30:00,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:00,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:30:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:00,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:30:00,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:00,573 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2024-11-07 16:30:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:00,709 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-07 16:30:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2024-11-07 16:30:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:00,710 INFO L225 Difference]: With dead ends: 99 [2024-11-07 16:30:00,710 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 16:30:00,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:00,711 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:00,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 16:30:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 16:30:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 98 states have internal predecessors, (112), 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) [2024-11-07 16:30:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-07 16:30:00,719 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 14 [2024-11-07 16:30:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:00,719 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-07 16:30:00,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2024-11-07 16:30:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-07 16:30:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:30:00,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:00,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:00,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:30:00,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:00,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash -475614716, now seen corresponding path program 1 times [2024-11-07 16:30:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:00,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751725196] [2024-11-07 16:30:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:00,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751725196] [2024-11-07 16:30:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751725196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:00,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:00,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805305946] [2024-11-07 16:30:00,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:00,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:30:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:30:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:30:00,872 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2024-11-07 16:30:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:00,973 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-11-07 16:30:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-11-07 16:30:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:00,974 INFO L225 Difference]: With dead ends: 160 [2024-11-07 16:30:00,975 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 16:30:00,975 INFO L431 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 [2024-11-07 16:30:00,976 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:00,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 301 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 16:30:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2024-11-07 16:30:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 98 states have internal predecessors, (111), 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) [2024-11-07 16:30:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2024-11-07 16:30:00,984 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2024-11-07 16:30:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:00,984 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2024-11-07 16:30:00,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2024-11-07 16:30:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2024-11-07 16:30:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:30:00,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:00,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:00,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:30:00,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:00,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash -475614743, now seen corresponding path program 1 times [2024-11-07 16:30:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:00,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997606223] [2024-11-07 16:30:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:01,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997606223] [2024-11-07 16:30:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997606223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:01,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:01,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:30:01,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943089865] [2024-11-07 16:30:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:01,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:30:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:30:01,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:30:01,215 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2024-11-07 16:30:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:01,386 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-11-07 16:30:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2024-11-07 16:30:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:01,388 INFO L225 Difference]: With dead ends: 165 [2024-11-07 16:30:01,388 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 16:30:01,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:01,390 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:01,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 16:30:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 113. [2024-11-07 16:30:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 112 states have internal predecessors, (127), 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) [2024-11-07 16:30:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2024-11-07 16:30:01,394 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 18 [2024-11-07 16:30:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:01,394 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2024-11-07 16:30:01,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2024-11-07 16:30:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2024-11-07 16:30:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 16:30:01,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:01,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:01,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:30:01,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -475614744, now seen corresponding path program 1 times [2024-11-07 16:30:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483186249] [2024-11-07 16:30:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:01,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483186249] [2024-11-07 16:30:01,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483186249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:01,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:01,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747568558] [2024-11-07 16:30:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:01,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:30:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:30:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:01,528 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-07 16:30:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:01,692 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2024-11-07 16:30:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:01,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-11-07 16:30:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:01,693 INFO L225 Difference]: With dead ends: 177 [2024-11-07 16:30:01,693 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 16:30:01,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:01,694 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:01,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 208 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 16:30:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2024-11-07 16:30:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 112 states have internal predecessors, (125), 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) [2024-11-07 16:30:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-11-07 16:30:01,698 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 18 [2024-11-07 16:30:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:01,698 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-07 16:30:01,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-07 16:30:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-11-07 16:30:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:30:01,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:01,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:01,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:30:01,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -764326860, now seen corresponding path program 1 times [2024-11-07 16:30:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:01,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56401605] [2024-11-07 16:30:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56401605] [2024-11-07 16:30:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56401605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587007307] [2024-11-07 16:30:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:01,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:01,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:01,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 16:30:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:01,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 16:30:02,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:02,034 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:02,067 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 16:30:02,068 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:02,106 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-07 16:30:02,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:02,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-07 16:30:02,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 16:30:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:30:02,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:02,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:02,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-07 16:30:02,394 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 28 [2024-11-07 16:30:02,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-07 16:30:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587007307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:02,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-11-07 16:30:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189610482] [2024-11-07 16:30:02,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:30:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:30:02,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=175, Unknown=10, NotChecked=0, Total=240 [2024-11-07 16:30:02,463 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 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) [2024-11-07 16:30:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:02,766 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-07 16:30:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 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 20 [2024-11-07 16:30:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:02,767 INFO L225 Difference]: With dead ends: 112 [2024-11-07 16:30:02,767 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 16:30:02,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=175, Unknown=10, NotChecked=0, Total=240 [2024-11-07 16:30:02,768 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:02,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 491 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 16:30:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-07 16:30:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.441860465116279) internal successors, (124), 111 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) [2024-11-07 16:30:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-07 16:30:02,770 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 20 [2024-11-07 16:30:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:02,770 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-07 16:30:02,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 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) [2024-11-07 16:30:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-07 16:30:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:30:02,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:02,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:02,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:30:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 16:30:02,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:02,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash -764326859, now seen corresponding path program 1 times [2024-11-07 16:30:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:02,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121119095] [2024-11-07 16:30:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:03,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121119095] [2024-11-07 16:30:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121119095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:03,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128553776] [2024-11-07 16:30:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:03,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:03,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:03,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:03,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 16:30:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:03,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:30:03,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:03,415 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:03,433 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:03,433 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:03,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 16:30:03,469 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-07 16:30:03,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:30:03,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:03,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:30:03,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:30:03,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 16:30:03,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 16:30:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:03,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:03,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-11-07 16:30:03,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-07 16:30:03,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-07 16:30:03,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:03,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-07 16:30:03,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:03,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-07 16:30:03,937 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 50 [2024-11-07 16:30:03,943 INFO L378 Elim1Store]: Elim1 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 96 treesize of output 78 [2024-11-07 16:30:03,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 16:30:03,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:30:03,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:03,965 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-07 16:30:03,968 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:30:03,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-07 16:30:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-07 16:30:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128553776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:04,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:04,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2024-11-07 16:30:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772490218] [2024-11-07 16:30:04,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:04,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:30:04,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:04,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:30:04,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=353, Unknown=3, NotChecked=120, Total=552 [2024-11-07 16:30:04,019 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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) [2024-11-07 16:30:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:04,468 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2024-11-07 16:30:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:30:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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 20 [2024-11-07 16:30:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:04,470 INFO L225 Difference]: With dead ends: 118 [2024-11-07 16:30:04,470 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 16:30:04,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=568, Unknown=3, NotChecked=156, Total=870 [2024-11-07 16:30:04,471 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:04,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 576 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 160 Unchecked, 0.3s Time] [2024-11-07 16:30:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 16:30:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-07 16:30:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 117 states have internal predecessors, (130), 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) [2024-11-07 16:30:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-11-07 16:30:04,475 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 20 [2024-11-07 16:30:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:04,475 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-11-07 16:30:04,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 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) [2024-11-07 16:30:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-11-07 16:30:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:30:04,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:04,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:04,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:30:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:04,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:04,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash 58337566, now seen corresponding path program 1 times [2024-11-07 16:30:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314112560] [2024-11-07 16:30:04,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:04,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:04,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314112560] [2024-11-07 16:30:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314112560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:04,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450421198] [2024-11-07 16:30:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:04,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:30:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:30:04,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:04,785 INFO L87 Difference]: Start difference. First operand 118 states and 130 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) [2024-11-07 16:30:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:04,946 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2024-11-07 16:30:04,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:04,947 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 21 [2024-11-07 16:30:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:04,948 INFO L225 Difference]: With dead ends: 186 [2024-11-07 16:30:04,948 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 16:30:04,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:04,948 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:04,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 242 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 16:30:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 118. [2024-11-07 16:30:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 117 states have internal predecessors, (129), 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) [2024-11-07 16:30:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-07 16:30:04,952 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 21 [2024-11-07 16:30:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:04,952 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-07 16:30:04,953 INFO L472 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) [2024-11-07 16:30:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-07 16:30:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:30:04,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:04,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:04,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:30:04,954 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:04,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash 58337567, now seen corresponding path program 1 times [2024-11-07 16:30:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511898463] [2024-11-07 16:30:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511898463] [2024-11-07 16:30:05,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511898463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:05,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:05,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:30:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618879240] [2024-11-07 16:30:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:05,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:30:05,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:05,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:30:05,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:30:05,143 INFO L87 Difference]: Start difference. First operand 118 states and 129 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) [2024-11-07 16:30:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:05,302 INFO L93 Difference]: Finished difference Result 167 states and 186 transitions. [2024-11-07 16:30:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:05,303 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 21 [2024-11-07 16:30:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:05,304 INFO L225 Difference]: With dead ends: 167 [2024-11-07 16:30:05,304 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 16:30:05,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:05,305 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:05,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 16:30:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 121. [2024-11-07 16:30:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 120 states have internal predecessors, (132), 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) [2024-11-07 16:30:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-11-07 16:30:05,308 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 21 [2024-11-07 16:30:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:05,308 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-11-07 16:30:05,308 INFO L472 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) [2024-11-07 16:30:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-11-07 16:30:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:30:05,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:05,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:05,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:30:05,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1527252530, now seen corresponding path program 1 times [2024-11-07 16:30:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132296487] [2024-11-07 16:30:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:05,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132296487] [2024-11-07 16:30:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132296487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:30:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916161574] [2024-11-07 16:30:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:05,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:30:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:30:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:30:05,586 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) [2024-11-07 16:30:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:05,788 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2024-11-07 16:30:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 16:30:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 [2024-11-07 16:30:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:05,790 INFO L225 Difference]: With dead ends: 149 [2024-11-07 16:30:05,790 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 16:30:05,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:30:05,791 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:05,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 497 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 16:30:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2024-11-07 16:30:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 136 states have internal predecessors, (149), 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) [2024-11-07 16:30:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-07 16:30:05,794 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 24 [2024-11-07 16:30:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:05,794 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-07 16:30:05,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) [2024-11-07 16:30:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-07 16:30:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:30:05,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:05,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:05,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:30:05,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1189100778, now seen corresponding path program 1 times [2024-11-07 16:30:05,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014894890] [2024-11-07 16:30:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:05,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:05,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014894890] [2024-11-07 16:30:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014894890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:30:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889385011] [2024-11-07 16:30:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:05,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:30:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:30:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:30:05,874 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-07 16:30:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:05,938 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2024-11-07 16:30:05,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:30:05,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 [2024-11-07 16:30:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:05,940 INFO L225 Difference]: With dead ends: 166 [2024-11-07 16:30:05,940 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 16:30:05,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:05,940 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:05,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:05,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 16:30:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2024-11-07 16:30:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 148 states have internal predecessors, (174), 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) [2024-11-07 16:30:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2024-11-07 16:30:05,946 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 26 [2024-11-07 16:30:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:05,946 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2024-11-07 16:30:05,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-07 16:30:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2024-11-07 16:30:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:30:05,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:05,946 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:05,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:30:05,947 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:05,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1517665639, now seen corresponding path program 2 times [2024-11-07 16:30:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:05,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970549999] [2024-11-07 16:30:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970549999] [2024-11-07 16:30:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970549999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:06,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571906994] [2024-11-07 16:30:06,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:30:06,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:06,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:06,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:06,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 16:30:06,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:30:06,485 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:30:06,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:30:06,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:06,496 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:06,512 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:30:06,512 INFO L378 Elim1Store]: Elim1 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 [2024-11-07 16:30:06,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 16:30:06,530 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-07 16:30:06,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:30:06,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:06,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:30:06,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:30:06,753 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 16:30:06,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-07 16:30:06,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-07 16:30:06,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-07 16:30:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-07 16:30:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:06,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:07,025 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-07 16:30:07,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) is different from false [2024-11-07 16:30:07,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_418) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_418) .cse2 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-07 16:30:07,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:07,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-07 16:30:07,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:07,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-07 16:30:07,275 INFO L378 Elim1Store]: Elim1 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 754 treesize of output 640 [2024-11-07 16:30:07,288 INFO L378 Elim1Store]: Elim1 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 415 treesize of output 385 [2024-11-07 16:30:07,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 104 [2024-11-07 16:30:07,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2024-11-07 16:30:07,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-11-07 16:30:07,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2024-11-07 16:30:07,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:07,344 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-07 16:30:07,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:07,351 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-07 16:30:07,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:30:07,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-07 16:30:07,357 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:30:07,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-07 16:30:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-07 16:30:07,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571906994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:07,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:07,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 27 [2024-11-07 16:30:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281495247] [2024-11-07 16:30:07,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:07,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:30:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:30:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=471, Unknown=25, NotChecked=144, Total=756 [2024-11-07 16:30:07,418 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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) [2024-11-07 16:30:08,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (<= (+ .cse0 .cse3 8) (select |c_#length| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 (+ .cse0 .cse3 4))))) is different from false [2024-11-07 16:30:08,042 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (<= (+ .cse0 .cse3 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 .cse3 4))))) is different from false [2024-11-07 16:30:08,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (<= 0 (+ .cse0 .cse3)) (<= (+ .cse0 .cse3 4) (select |c_#length| .cse1)) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-07 16:30:08,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_420 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_420) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_421) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-11-07 16:30:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:08,277 INFO L93 Difference]: Finished difference Result 170 states and 197 transitions. [2024-11-07 16:30:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:30:08,278 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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 [2024-11-07 16:30:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:08,279 INFO L225 Difference]: With dead ends: 170 [2024-11-07 16:30:08,279 INFO L226 Difference]: Without dead ends: 170 [2024-11-07 16:30:08,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=889, Unknown=29, NotChecked=490, Total=1640 [2024-11-07 16:30:08,280 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 74 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 7 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:08,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 739 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 508 Invalid, 21 Unknown, 373 Unchecked, 0.5s Time] [2024-11-07 16:30:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-07 16:30:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-11-07 16:30:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.375886524822695) internal successors, (194), 166 states have internal predecessors, (194), 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) [2024-11-07 16:30:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-11-07 16:30:08,284 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 26 [2024-11-07 16:30:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:08,284 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-11-07 16:30:08,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 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) [2024-11-07 16:30:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-11-07 16:30:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:30:08,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:08,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:08,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 16:30:08,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:08,486 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:08,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1792581374, now seen corresponding path program 1 times [2024-11-07 16:30:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705396923] [2024-11-07 16:30:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705396923] [2024-11-07 16:30:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705396923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:08,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:30:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969267248] [2024-11-07 16:30:08,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:30:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:08,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:30:08,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:30:08,595 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-07 16:30:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:08,704 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2024-11-07 16:30:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:30:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2024-11-07 16:30:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:08,705 INFO L225 Difference]: With dead ends: 246 [2024-11-07 16:30:08,705 INFO L226 Difference]: Without dead ends: 246 [2024-11-07 16:30:08,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:08,706 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 74 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:08,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 261 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-07 16:30:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 168. [2024-11-07 16:30:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 167 states have internal predecessors, (195), 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) [2024-11-07 16:30:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2024-11-07 16:30:08,713 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 27 [2024-11-07 16:30:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:08,714 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2024-11-07 16:30:08,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-07 16:30:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2024-11-07 16:30:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:30:08,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:08,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:08,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:30:08,715 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash 264552428, now seen corresponding path program 1 times [2024-11-07 16:30:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163014012] [2024-11-07 16:30:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163014012] [2024-11-07 16:30:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163014012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022580618] [2024-11-07 16:30:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:30:08,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:30:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:08,836 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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) [2024-11-07 16:30:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:08,994 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2024-11-07 16:30:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:08,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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 28 [2024-11-07 16:30:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:08,995 INFO L225 Difference]: With dead ends: 249 [2024-11-07 16:30:08,995 INFO L226 Difference]: Without dead ends: 249 [2024-11-07 16:30:08,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:30:08,996 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 65 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:08,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 248 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-07 16:30:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 171. [2024-11-07 16:30:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 145 states have (on average 1.3655172413793104) internal successors, (198), 170 states have internal predecessors, (198), 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) [2024-11-07 16:30:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2024-11-07 16:30:09,003 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2024-11-07 16:30:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:09,003 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2024-11-07 16:30:09,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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) [2024-11-07 16:30:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2024-11-07 16:30:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:30:09,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:09,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:09,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:30:09,008 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:09,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:09,009 INFO L85 PathProgramCache]: Analyzing trace with hash -388809147, now seen corresponding path program 1 times [2024-11-07 16:30:09,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:09,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703349576] [2024-11-07 16:30:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703349576] [2024-11-07 16:30:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703349576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:09,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:09,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:30:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345377928] [2024-11-07 16:30:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:30:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:30:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:30:09,194 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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) [2024-11-07 16:30:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:09,342 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2024-11-07 16:30:09,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:30:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 [2024-11-07 16:30:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:09,344 INFO L225 Difference]: With dead ends: 193 [2024-11-07 16:30:09,344 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 16:30:09,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:30:09,344 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 141 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:09,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 190 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 16:30:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2024-11-07 16:30:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.36986301369863) internal successors, (200), 171 states have internal predecessors, (200), 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) [2024-11-07 16:30:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2024-11-07 16:30:09,349 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 29 [2024-11-07 16:30:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:09,350 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2024-11-07 16:30:09,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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) [2024-11-07 16:30:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2024-11-07 16:30:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:30:09,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:09,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:09,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:30:09,351 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:09,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash -388809146, now seen corresponding path program 1 times [2024-11-07 16:30:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933361773] [2024-11-07 16:30:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933361773] [2024-11-07 16:30:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933361773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:30:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17265317] [2024-11-07 16:30:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:30:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:09,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:30:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:30:09,404 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-11-07 16:30:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:09,450 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2024-11-07 16:30:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:30:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 [2024-11-07 16:30:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:09,452 INFO L225 Difference]: With dead ends: 167 [2024-11-07 16:30:09,452 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 16:30:09,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:30:09,453 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 111 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:09,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:30:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 16:30:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-07 16:30:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 166 states have internal predecessors, (192), 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) [2024-11-07 16:30:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2024-11-07 16:30:09,458 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 29 [2024-11-07 16:30:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:09,458 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2024-11-07 16:30:09,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-11-07 16:30:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2024-11-07 16:30:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:30:09,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:09,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 16:30:09,459 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056854, now seen corresponding path program 1 times [2024-11-07 16:30:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119285579] [2024-11-07 16:30:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:09,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:09,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119285579] [2024-11-07 16:30:09,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119285579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:09,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:30:09,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322119361] [2024-11-07 16:30:09,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:09,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:30:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:09,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:30:09,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:30:09,843 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-11-07 16:30:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:10,166 INFO L93 Difference]: Finished difference Result 201 states and 230 transitions. [2024-11-07 16:30:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:30:10,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 [2024-11-07 16:30:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:10,167 INFO L225 Difference]: With dead ends: 201 [2024-11-07 16:30:10,167 INFO L226 Difference]: Without dead ends: 201 [2024-11-07 16:30:10,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:30:10,168 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 59 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:10,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 465 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-07 16:30:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 176. [2024-11-07 16:30:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3419354838709678) internal successors, (208), 175 states have internal predecessors, (208), 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) [2024-11-07 16:30:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2024-11-07 16:30:10,172 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 29 [2024-11-07 16:30:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:10,172 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2024-11-07 16:30:10,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-11-07 16:30:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2024-11-07 16:30:10,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:30:10,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:10,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:10,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 16:30:10,173 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:10,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056855, now seen corresponding path program 1 times [2024-11-07 16:30:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:10,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720356678] [2024-11-07 16:30:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:10,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:10,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720356678] [2024-11-07 16:30:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720356678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:10,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:30:10,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492340838] [2024-11-07 16:30:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:10,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:30:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:30:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:30:10,433 INFO L87 Difference]: Start difference. First operand 176 states and 208 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-11-07 16:30:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:10,775 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-11-07 16:30:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:30:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 [2024-11-07 16:30:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:10,777 INFO L225 Difference]: With dead ends: 200 [2024-11-07 16:30:10,777 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 16:30:10,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:30:10,778 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:10,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 449 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 16:30:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 182. [2024-11-07 16:30:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 181 states have internal predecessors, (214), 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) [2024-11-07 16:30:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2024-11-07 16:30:10,783 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 29 [2024-11-07 16:30:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:10,783 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2024-11-07 16:30:10,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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) [2024-11-07 16:30:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2024-11-07 16:30:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:30:10,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:10,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:10,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 16:30:10,784 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1276636110, now seen corresponding path program 1 times [2024-11-07 16:30:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477976184] [2024-11-07 16:30:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:11,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477976184] [2024-11-07 16:30:11,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477976184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:11,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:11,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 16:30:11,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725238541] [2024-11-07 16:30:11,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:11,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:30:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:11,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:30:11,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:30:11,315 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 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) [2024-11-07 16:30:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:11,691 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2024-11-07 16:30:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:30:11,691 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 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 32 [2024-11-07 16:30:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:11,692 INFO L225 Difference]: With dead ends: 206 [2024-11-07 16:30:11,692 INFO L226 Difference]: Without dead ends: 206 [2024-11-07 16:30:11,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:30:11,693 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:11,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 488 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-07 16:30:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2024-11-07 16:30:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 181 states have internal predecessors, (213), 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) [2024-11-07 16:30:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2024-11-07 16:30:11,697 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 32 [2024-11-07 16:30:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:11,697 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2024-11-07 16:30:11,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 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) [2024-11-07 16:30:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2024-11-07 16:30:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:30:11,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:11,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:11,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:30:11,699 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1276647095, now seen corresponding path program 1 times [2024-11-07 16:30:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:11,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935228642] [2024-11-07 16:30:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935228642] [2024-11-07 16:30:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935228642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:11,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:11,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 16:30:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245930595] [2024-11-07 16:30:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:30:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:30:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:30:11,961 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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) [2024-11-07 16:30:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:12,247 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2024-11-07 16:30:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:30:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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 32 [2024-11-07 16:30:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:12,249 INFO L225 Difference]: With dead ends: 203 [2024-11-07 16:30:12,249 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 16:30:12,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-07 16:30:12,249 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 71 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:12,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 488 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 16:30:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 182. [2024-11-07 16:30:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 181 states have internal predecessors, (211), 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) [2024-11-07 16:30:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2024-11-07 16:30:12,255 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 32 [2024-11-07 16:30:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:12,255 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2024-11-07 16:30:12,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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) [2024-11-07 16:30:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2024-11-07 16:30:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:30:12,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:12,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:12,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 16:30:12,256 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 921013898, now seen corresponding path program 1 times [2024-11-07 16:30:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9378301] [2024-11-07 16:30:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:12,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:12,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9378301] [2024-11-07 16:30:12,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9378301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:12,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:12,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 16:30:12,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147318187] [2024-11-07 16:30:12,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:12,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:30:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:30:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:30:12,825 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 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) [2024-11-07 16:30:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:13,374 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2024-11-07 16:30:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:30:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 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 [2024-11-07 16:30:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:13,375 INFO L225 Difference]: With dead ends: 197 [2024-11-07 16:30:13,375 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 16:30:13,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-11-07 16:30:13,376 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:13,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 724 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 16:30:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2024-11-07 16:30:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 176 states have internal predecessors, (203), 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) [2024-11-07 16:30:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2024-11-07 16:30:13,381 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 33 [2024-11-07 16:30:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:13,382 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2024-11-07 16:30:13,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 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) [2024-11-07 16:30:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2024-11-07 16:30:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:30:13,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:13,382 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:13,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 16:30:13,383 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:13,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -338052361, now seen corresponding path program 1 times [2024-11-07 16:30:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:13,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641601972] [2024-11-07 16:30:13,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:13,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:13,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641601972] [2024-11-07 16:30:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641601972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073462987] [2024-11-07 16:30:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:13,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:13,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:13,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:13,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 16:30:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:13,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-07 16:30:13,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:13,955 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-07 16:30:13,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-07 16:30:14,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:14,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 69 [2024-11-07 16:30:14,418 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 13 [2024-11-07 16:30:14,597 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_22| Int) (|v_ULTIMATE.start_main_#t~mem22#1.base_9| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22|) 0) (not (= |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_9| 0) |v_ULTIMATE.start_main_~#list~0#1.base_22| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_22| 1) |v_ULTIMATE.start_main_#t~mem22#1.base_9|) 0))) is different from true [2024-11-07 16:30:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:14,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:14,732 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-11-07 16:30:14,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0)) (= .cse0 0) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_753) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-07 16:30:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073462987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:14,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:14,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-11-07 16:30:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093404980] [2024-11-07 16:30:14,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:30:14,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:14,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:30:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=397, Unknown=3, NotChecked=82, Total=552 [2024-11-07 16:30:14,879 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 24 states have internal predecessors, (95), 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) [2024-11-07 16:30:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:15,669 INFO L93 Difference]: Finished difference Result 255 states and 286 transitions. [2024-11-07 16:30:15,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:30:15,669 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 24 states have internal predecessors, (95), 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 34 [2024-11-07 16:30:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:15,670 INFO L225 Difference]: With dead ends: 255 [2024-11-07 16:30:15,670 INFO L226 Difference]: Without dead ends: 253 [2024-11-07 16:30:15,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=729, Unknown=3, NotChecked=114, Total=992 [2024-11-07 16:30:15,671 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 71 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:15,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 650 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 565 Invalid, 0 Unknown, 281 Unchecked, 0.4s Time] [2024-11-07 16:30:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-07 16:30:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 207. [2024-11-07 16:30:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 187 states have (on average 1.2566844919786095) internal successors, (235), 206 states have internal predecessors, (235), 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) [2024-11-07 16:30:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2024-11-07 16:30:15,675 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 34 [2024-11-07 16:30:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:15,675 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2024-11-07 16:30:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.130434782608695) internal successors, (95), 24 states have internal predecessors, (95), 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) [2024-11-07 16:30:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2024-11-07 16:30:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:30:15,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:15,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:15,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:30:15,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 16:30:15,881 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:15,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -338052388, now seen corresponding path program 1 times [2024-11-07 16:30:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850681605] [2024-11-07 16:30:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:16,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850681605] [2024-11-07 16:30:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850681605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964414590] [2024-11-07 16:30:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:16,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:16,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:16,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:16,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 16:30:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:16,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-07 16:30:16,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:16,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:30:16,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 16:30:16,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:30:16,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 16:30:16,749 INFO L378 Elim1Store]: Elim1 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 11 [2024-11-07 16:30:16,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 16:30:16,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:30:16,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2024-11-07 16:30:16,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:30:16,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:30:16,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 19 [2024-11-07 16:30:17,015 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-07 16:30:17,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 19 [2024-11-07 16:30:17,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:30:17,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:30:17,285 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2024-11-07 16:30:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:30:17,479 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-11-07 16:30:17,634 INFO L378 Elim1Store]: Elim1 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 350 treesize of output 318 [2024-11-07 16:30:17,658 INFO L378 Elim1Store]: Elim1 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 56 treesize of output 40 [2024-11-07 16:30:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964414590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:30:17,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:30:17,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 33 [2024-11-07 16:30:17,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502020503] [2024-11-07 16:30:17,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:30:17,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 16:30:17,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 16:30:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 16:30:17,820 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 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) [2024-11-07 16:30:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:18,387 INFO L93 Difference]: Finished difference Result 264 states and 295 transitions. [2024-11-07 16:30:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:30:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 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 34 [2024-11-07 16:30:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:18,389 INFO L225 Difference]: With dead ends: 264 [2024-11-07 16:30:18,389 INFO L226 Difference]: Without dead ends: 246 [2024-11-07 16:30:18,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2024-11-07 16:30:18,390 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 151 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:18,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1211 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-07 16:30:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 189. [2024-11-07 16:30:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 188 states have internal predecessors, (216), 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) [2024-11-07 16:30:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2024-11-07 16:30:18,400 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 34 [2024-11-07 16:30:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:18,401 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2024-11-07 16:30:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 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) [2024-11-07 16:30:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2024-11-07 16:30:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:30:18,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:18,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:18,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 16:30:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 16:30:18,603 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash 658362991, now seen corresponding path program 1 times [2024-11-07 16:30:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318972238] [2024-11-07 16:30:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:18,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318972238] [2024-11-07 16:30:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318972238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:18,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:18,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 16:30:18,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575075120] [2024-11-07 16:30:18,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:18,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:30:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:18,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:30:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:30:18,943 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 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) [2024-11-07 16:30:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:19,218 INFO L93 Difference]: Finished difference Result 213 states and 230 transitions. [2024-11-07 16:30:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:30:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 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 35 [2024-11-07 16:30:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:19,220 INFO L225 Difference]: With dead ends: 213 [2024-11-07 16:30:19,220 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 16:30:19,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:30:19,221 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 127 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:19,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 326 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 16:30:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 191. [2024-11-07 16:30:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.2748538011695907) internal successors, (218), 190 states have internal predecessors, (218), 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) [2024-11-07 16:30:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 218 transitions. [2024-11-07 16:30:19,226 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 218 transitions. Word has length 35 [2024-11-07 16:30:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 218 transitions. [2024-11-07 16:30:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 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) [2024-11-07 16:30:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 218 transitions. [2024-11-07 16:30:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:30:19,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:19,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:19,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 16:30:19,227 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:19,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1823666657, now seen corresponding path program 1 times [2024-11-07 16:30:19,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:19,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473117755] [2024-11-07 16:30:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:19,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473117755] [2024-11-07 16:30:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473117755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 16:30:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520083111] [2024-11-07 16:30:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:19,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:30:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:30:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:30:19,593 INFO L87 Difference]: Start difference. First operand 191 states and 218 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 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) [2024-11-07 16:30:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:20,086 INFO L93 Difference]: Finished difference Result 264 states and 287 transitions. [2024-11-07 16:30:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:30:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 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 [2024-11-07 16:30:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:20,087 INFO L225 Difference]: With dead ends: 264 [2024-11-07 16:30:20,087 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 16:30:20,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-11-07 16:30:20,088 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 123 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:20,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 506 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:30:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 16:30:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 194. [2024-11-07 16:30:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.2701149425287357) internal successors, (221), 193 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) [2024-11-07 16:30:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2024-11-07 16:30:20,092 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 38 [2024-11-07 16:30:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:20,093 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2024-11-07 16:30:20,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 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) [2024-11-07 16:30:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2024-11-07 16:30:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:30:20,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:20,093 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:20,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 16:30:20,094 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:20,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 155608979, now seen corresponding path program 1 times [2024-11-07 16:30:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24276909] [2024-11-07 16:30:20,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:20,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:20,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:20,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24276909] [2024-11-07 16:30:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24276909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:20,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:20,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 16:30:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404832853] [2024-11-07 16:30:20,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:20,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:30:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:30:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:30:20,374 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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) [2024-11-07 16:30:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:20,650 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2024-11-07 16:30:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:30:20,650 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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 39 [2024-11-07 16:30:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:20,651 INFO L225 Difference]: With dead ends: 219 [2024-11-07 16:30:20,651 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 16:30:20,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:30:20,652 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 74 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:20,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 621 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:30:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 16:30:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2024-11-07 16:30:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.2586206896551724) internal successors, (219), 193 states have internal predecessors, (219), 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) [2024-11-07 16:30:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2024-11-07 16:30:20,657 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 39 [2024-11-07 16:30:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2024-11-07 16:30:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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) [2024-11-07 16:30:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2024-11-07 16:30:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 16:30:20,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:20,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 16:30:20,658 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -699091342, now seen corresponding path program 1 times [2024-11-07 16:30:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365356086] [2024-11-07 16:30:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365356086] [2024-11-07 16:30:20,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365356086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:30:20,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:30:20,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:30:20,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361681026] [2024-11-07 16:30:20,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:30:20,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:30:20,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:30:20,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:30:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:30:20,793 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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) [2024-11-07 16:30:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:30:20,930 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2024-11-07 16:30:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:30:20,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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 39 [2024-11-07 16:30:20,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:30:20,931 INFO L225 Difference]: With dead ends: 209 [2024-11-07 16:30:20,931 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 16:30:20,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:30:20,932 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 144 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:30:20,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 196 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:30:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 16:30:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2024-11-07 16:30:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.2705882352941176) internal successors, (216), 189 states have internal predecessors, (216), 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) [2024-11-07 16:30:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2024-11-07 16:30:20,936 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 39 [2024-11-07 16:30:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:30:20,936 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2024-11-07 16:30:20,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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) [2024-11-07 16:30:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2024-11-07 16:30:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 16:30:20,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:30:20,936 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:30:20,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 16:30:20,937 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-07 16:30:20,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:30:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1498240746, now seen corresponding path program 1 times [2024-11-07 16:30:20,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:30:20,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694727474] [2024-11-07 16:30:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:30:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:30:21,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:30:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694727474] [2024-11-07 16:30:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694727474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:30:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573056811] [2024-11-07 16:30:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:30:21,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:30:21,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:30:21,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 16:30:21,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 16:30:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:30:22,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-07 16:30:22,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:30:22,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:30:23,017 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-07 16:30:23,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-07 16:30:24,388 INFO L349 Elim1Store]: treesize reduction 48, result has 56.0 percent of original size [2024-11-07 16:30:24,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 374 treesize of output 326 [2024-11-07 16:31:10,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse64 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse43 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse6 (= .cse64 0))) (and (let ((.cse61 (store |c_ULTIMATE.start_main_old_#valid#1| .cse64 1)) (.cse20 (= .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse89 (exists ((v_prenex_1 Int)) (not (= (select .cse4 v_prenex_1) 0)))) (.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (let ((.cse31 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse203 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse202 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse203 1))) (and (= (select .cse202 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse202 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse203 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse203)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse203)))))) (.cse41 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_56 Int)) (let ((.cse199 (select .cse4 v_prenex_1))) (let ((.cse201 (store (store .cse3 .cse199 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)))) (let ((.cse200 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse201 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse199 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse199) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse200 v_arrayElimCell_56) 0) (not (= .cse199 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse199 0)) (= (select .cse200 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse199 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (= |c_#valid| (store .cse201 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)))))))) (.cse42 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse197 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse196 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse197 1)) (.cse198 (select .cse4 v_prenex_1))) (and (= (select .cse196 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse196 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse197 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse198 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse197) (not (= .cse198 .cse197))))))) (.cse7 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_54 Int)) (let ((.cse194 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse193 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse194 1)) (.cse195 (select .cse4 v_prenex_1))) (and (= v_DerPreprocessor_3 (select .cse193 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse194 1) v_arrayElimCell_54 0)) (not (= .cse195 0)) (= (select .cse193 v_arrayElimCell_54) 0) (not (= 0 .cse194)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse194) (not (= .cse195 .cse194))))))) (.cse12 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_54 Int) (v_DerPreprocessor_3 Int)) (let ((.cse192 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse190 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse192 1)) (.cse191 (select .cse4 v_prenex_1))) (and (= v_DerPreprocessor_3 (select .cse190 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_54)) (not (= .cse191 0)) (= (select .cse190 v_arrayElimCell_54) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse192 1) v_arrayElimCell_54 (select |c_#valid| v_arrayElimCell_54)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse192)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse192) (not (= .cse191 .cse192))))))) (.cse17 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_56 Int)) (let ((.cse186 (select .cse4 v_prenex_1))) (let ((.cse189 (store (store .cse3 .cse186 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)))) (let ((.cse187 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse189 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse186 1)) (.cse188 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse186) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse187 v_arrayElimCell_56) 0) (not (= .cse186 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse186 0)) (= (select .cse187 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= 0 .cse188)) (not (= .cse186 .cse188)) (= |c_#valid| (store .cse189 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)))))))) (.cse22 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= 0 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))) (.cse26 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_56 Int)) (let ((.cse183 (select .cse4 v_prenex_1))) (let ((.cse185 (store (store .cse3 .cse183 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)))) (let ((.cse184 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse185 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse183 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse183) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse184 v_arrayElimCell_56) 0) (not (= .cse183 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse183 0)) (= (select .cse184 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse185 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)))))))) (.cse30 (and (or (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse180 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse179 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse180 1))) (and (= (select .cse179 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse179 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse180 1) v_arrayElimCell_56 0)) (not (= 0 .cse180)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse180))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_56 Int)) (let ((.cse182 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse181 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse182 1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_56)) (= (select .cse181 v_arrayElimCell_56) 0) (= v_DerPreprocessor_3 (select .cse181 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse182 1) v_arrayElimCell_56 (select |c_#valid| v_arrayElimCell_56)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse182)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse182)))))) .cse89)) (.cse45 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse178 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (not (= .cse64 .cse178)) (not (= (select .cse4 v_prenex_1) .cse178)))))) (.cse120 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_54 Int)) (let ((.cse177 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse176 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse177 1))) (and (= v_DerPreprocessor_3 (select .cse176 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse177 1) v_arrayElimCell_54 0)) (= (select .cse176 v_arrayElimCell_54) 0) (not (= 0 .cse177)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse177) (not (= (select .cse4 v_prenex_1) .cse177))))))) (.cse121 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_54 Int)) (let ((.cse175 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse174 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse175 1))) (and (= v_DerPreprocessor_3 (select .cse174 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_54)) (= (select .cse174 v_arrayElimCell_54) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse175 1) v_arrayElimCell_54 (select |c_#valid| v_arrayElimCell_54)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse175)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse175) (not (= (select .cse4 v_prenex_1) .cse175))))))) (.cse54 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse173 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse172 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse173 1))) (and (= (select .cse172 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse172 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse173 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse173) (not (= (select .cse4 v_prenex_1) .cse173))))))) (.cse139 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse171 (select .cse4 v_prenex_1))) (and (not (= .cse64 .cse171)) (not (= .cse171 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) (.cse18 (exists ((v_prenex_1 Int)) (not (= .cse64 (select .cse4 v_prenex_1))))) (.cse5 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int)) (let ((.cse170 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse169 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse170 1))) (and (= (select .cse169 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= v_DerPreprocessor_3 (select .cse169 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse170 1) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse170)))))) (.cse81 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= (select .cse4 v_prenex_1) (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))) (.cse66 (store .cse3 .cse64 1)) (.cse67 (not .cse20)) (.cse68 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse64) 0)) (.cse58 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse168 (select .cse4 v_prenex_1)) (.cse167 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (not (= .cse64 .cse167)) (not (= .cse64 .cse168)) (not (= .cse168 .cse167)))))) (.cse19 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_2 Int)) (let ((.cse166 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse64 1))) (and (= |c_#valid| (store .cse61 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse166 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse166 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2))))) (.cse21 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (not (= .cse64 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))) (or (and (or (exists ((v_DerPreprocessor_68 Int) (|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int)) (let ((.cse0 (select .cse4 v_prenex_1))) (let ((.cse2 (store .cse3 .cse0 1))) (let ((.cse1 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse2 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_68) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse0 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse0) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse1 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse2 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) .cse5) .cse6) (and (or .cse7 (exists ((v_DerPreprocessor_11 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_56 Int)) (let ((.cse9 (select |c_#valid| v_arrayElimCell_56)) (.cse8 (select .cse4 v_prenex_1))) (let ((.cse10 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_11) .cse8 1) v_arrayElimCell_56 .cse9) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse8 1)) (.cse11 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse8) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse8 1) v_arrayElimCell_56 .cse9) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse10 v_arrayElimCell_56) 0) (not (= .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse8 0)) (= (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= 0 .cse11)) (not (= .cse8 .cse11)))))) .cse12 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_12 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse14 (select .cse4 v_prenex_1))) (let ((.cse15 (store .cse3 .cse14 1))) (let ((.cse13 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse15 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse14 1)) (.cse16 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select .cse13 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse14) 0) (= (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse14 0)) (= |c_#valid| (store .cse15 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= 0 .cse16)) (not (= .cse14 .cse16))))))) .cse17) .cse6) (and .cse18 .cse19 .cse20 .cse21) (and .cse6 (or (and .cse22 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_78 Int) (v_prenex_1 Int)) (let ((.cse23 (select .cse4 v_prenex_1))) (let ((.cse25 (store .cse3 .cse23 1))) (let ((.cse24 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse25 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_78) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse23 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse23) 0) (= (select .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse23 0)) (= |c_#valid| (store .cse25 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse24 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0)))))) .cse26 (exists ((v_DerPreprocessor_77 Int) (v_prenex_1 Int) (v_arrayElimCell_56 Int)) (let ((.cse28 (select |c_#valid| v_arrayElimCell_56)) (.cse27 (select .cse4 v_prenex_1))) (let ((.cse29 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_77) .cse27 1) v_arrayElimCell_56 .cse28) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse27 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse27) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse27 1) v_arrayElimCell_56 .cse28) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse27 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse27 0)) (= (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse29 v_arrayElimCell_56) 0))))))) .cse30)) (and (or .cse31 (and .cse22 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_70 Int)) (let ((.cse32 (select .cse4 v_prenex_1))) (let ((.cse33 (store .cse3 .cse32 1))) (let ((.cse34 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse33 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_70) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse32 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse32) 0) (not (= .cse32 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse34 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse34 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))))) .cse6) (and (or (exists ((v_DerPreprocessor_8 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_56 Int)) (let ((.cse37 (select |c_#valid| v_arrayElimCell_56)) (.cse36 (select .cse4 v_prenex_1))) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_8) .cse36 1) v_arrayElimCell_56 .cse37) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse36 1))) (and (= (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse36) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse36 1) v_arrayElimCell_56 .cse37) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse36 0)) (= (select .cse35 v_arrayElimCell_56) 0) (not (= .cse36 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse38 (select .cse4 v_prenex_1))) (let ((.cse40 (store .cse3 .cse38 1))) (let ((.cse39 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse40 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse38 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse38) 0) (not (= .cse38 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse38 0)) (= (select .cse39 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse40 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse39 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse38 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) .cse41 .cse42) .cse6) (and .cse43 (let ((.cse44 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_2 Int) (v_arrayElimCell_55 Int)) (let ((.cse153 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse64 1))) (and (= (select .cse153 v_arrayElimCell_55) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= |c_#valid| (store (store .cse61 v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse153 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2)))) (exists ((v_prenex_2 Int) (v_arrayElimCell_55 Int)) (let ((.cse154 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_2) .cse64 1))) (and (= (select .cse154 v_arrayElimCell_55) 0) (= |c_#valid| (store .cse61 v_arrayElimCell_55 0)) (= (select .cse154 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_2))))))) (let ((.cse77 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_55 Int)) (let ((.cse150 (select .cse4 v_prenex_1))) (let ((.cse152 (store (store .cse3 .cse150 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)))) (let ((.cse151 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse152 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse150 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse150) 0) (= (select .cse151 v_arrayElimCell_55) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= |c_#valid| (store .cse152 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse150 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse151 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse85 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_55 Int)) (let ((.cse148 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse149 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse148 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse148 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse149 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= (select .cse149 v_arrayElimCell_55) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse148)))))) (.cse60 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_arrayElimCell_55 Int)) (let ((.cse147 (store .cse66 v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)))) (let ((.cse146 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse147 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (select .cse146 v_arrayElimCell_55) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= (select .cse146 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse147 |v_ULTIMATE.start_freeData_~data#1.base_20| 0))))))) (.cse59 (and .cse44 .cse20))) (or (and .cse44 .cse20 .cse45) (and (or (exists ((v_DerPreprocessor_26 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_55 Int)) (let ((.cse47 (select |c_#valid| v_arrayElimCell_55)) (.cse46 (select .cse4 v_prenex_1))) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_26) .cse46 1) v_arrayElimCell_55 .cse47) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse46 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse46 1) v_arrayElimCell_55 .cse47) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse46) 0) (= (select .cse48 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse48 v_arrayElimCell_55) 0) (not (= .cse46 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse46 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_55 Int)) (let ((.cse49 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse49 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse49 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse50 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= (select .cse50 v_arrayElimCell_55) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse49) (not (= (select .cse4 v_prenex_1) .cse49)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_55 Int)) (let ((.cse51 (select .cse4 v_prenex_1))) (let ((.cse53 (store (store .cse3 .cse51 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)))) (let ((.cse52 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse53 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse51 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse51) 0) (= (select .cse52 v_arrayElimCell_55) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse51 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) .cse54 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_27 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse55 (select .cse4 v_prenex_1))) (let ((.cse57 (store .cse3 .cse55 1))) (let ((.cse56 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse57 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse55 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse55) 0) (= (select .cse56 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse57 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse56 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse55 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))))) .cse6) (and .cse58 (or .cse59 (and (or .cse60 (exists ((v_DerPreprocessor_57 Int) (v_arrayElimCell_55 Int)) (let ((.cse62 (select |c_#valid| v_arrayElimCell_55))) (let ((.cse63 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_57) .cse64 1) v_arrayElimCell_55 .cse62) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= |c_#valid| (store (store .cse61 v_arrayElimCell_55 .cse62) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse63 v_arrayElimCell_55) 0) (= (select .cse63 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_58 Int)) (let ((.cse65 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_58) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (select .cse65 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= 1 (select .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|))))) .cse67)) .cse68) (and .cse44 .cse20 .cse21) (and .cse18 (or .cse59 (and .cse67 (or .cse60 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_55 Int)) (let ((.cse69 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_55) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse69 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse69 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (exists ((v_DerPreprocessor_54 Int) (v_arrayElimCell_55 Int)) (let ((.cse70 (select |c_#valid| v_arrayElimCell_55))) (let ((.cse71 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_54) .cse64 1) v_arrayElimCell_55 .cse70) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= |c_#valid| (store (store .cse61 v_arrayElimCell_55 .cse70) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse71 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse71 v_arrayElimCell_55) 0)))))))) .cse68) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_55 Int)) (let ((.cse72 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse73 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse72 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse72 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse73 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= (select .cse73 v_arrayElimCell_55) 0) (not (= 0 .cse72)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse72))))) .cse31 (and .cse22 (or (exists ((v_DerPreprocessor_23 Int) (v_prenex_1 Int) (v_arrayElimCell_55 Int)) (let ((.cse75 (select |c_#valid| v_arrayElimCell_55)) (.cse74 (select .cse4 v_prenex_1))) (let ((.cse76 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_23) .cse74 1) v_arrayElimCell_55 .cse75) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse74 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse74 1) v_arrayElimCell_55 .cse75) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse76 v_arrayElimCell_55) 0) (= (select .cse76 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse74) 0) (not (= .cse74 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse77 (exists ((v_DerPreprocessor_24 Int) (|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int)) (let ((.cse78 (select .cse4 v_prenex_1))) (let ((.cse79 (store .cse3 .cse78 1))) (let ((.cse80 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse79 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse78 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse78) 0) (not (= .cse78 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse79 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse80 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse80 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))))) .cse6) (and .cse44 .cse20 .cse81) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_42 Int)) (let ((.cse82 (select .cse4 v_prenex_1))) (let ((.cse83 (store .cse3 .cse82 1))) (let ((.cse84 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse83 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse82 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse82) 0) (not (= .cse82 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse83 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse84 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse84 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse85 .cse77 (exists ((v_prenex_1 Int) (v_DerPreprocessor_41 Int) (v_arrayElimCell_55 Int)) (let ((.cse87 (select |c_#valid| v_arrayElimCell_55)) (.cse86 (select .cse4 v_prenex_1))) (let ((.cse88 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_41) .cse86 1) v_arrayElimCell_55 .cse87) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse86 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse86 1) v_arrayElimCell_55 .cse87) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse86) 0) (= (select .cse88 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= 0 (select .cse88 v_arrayElimCell_55)))))) .cse5) .cse6) (and (or (and (or .cse85 .cse5) .cse89) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_arrayElimCell_55 Int)) (let ((.cse90 (select .cse4 v_prenex_1))) (let ((.cse92 (store (store .cse3 .cse90 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)))) (let ((.cse91 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse92 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse90 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse90) 0) (= (select .cse91 v_arrayElimCell_55) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= |c_#valid| (store .cse92 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse90 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse90 0)) (= (select .cse91 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_DerPreprocessor_46 Int) (|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int)) (let ((.cse93 (select .cse4 v_prenex_1))) (let ((.cse95 (store .cse3 .cse93 1))) (let ((.cse94 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse95 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse93 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse93) 0) (= (select .cse94 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse93 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse93 0)) (= |c_#valid| (store .cse95 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse94 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_DerPreprocessor_45 Int) (v_prenex_1 Int) (v_arrayElimCell_55 Int)) (let ((.cse97 (select |c_#valid| v_arrayElimCell_55)) (.cse96 (select .cse4 v_prenex_1))) (let ((.cse98 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_45) .cse96 1) v_arrayElimCell_55 .cse97) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse96 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse96 1) v_arrayElimCell_55 .cse97) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse96) 0) (= (select .cse98 v_arrayElimCell_55) 0) (not (= .cse96 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse96 0)) (= (select .cse98 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse6) (and (or (exists ((v_DerPreprocessor_47 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_56 Int)) (let ((.cse101 (select |c_#valid| v_arrayElimCell_56)) (.cse99 (select .cse4 v_prenex_1))) (let ((.cse100 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_47) .cse99 1) v_arrayElimCell_56 .cse101) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse99 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse99) 0) (= (select .cse100 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse99 1) v_arrayElimCell_56 .cse101) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse99 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse99 0)) (not (= .cse99 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (= (select .cse100 v_arrayElimCell_56) 0))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_48 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse102 (select .cse4 v_prenex_1))) (let ((.cse103 (store .cse3 .cse102 1))) (let ((.cse104 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse103 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse102 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse102) 0) (not (= .cse102 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse102 0)) (= |c_#valid| (store .cse103 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse104 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse104 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse102 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)))))))) .cse41 .cse42 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_55 Int)) (let ((.cse105 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (let ((.cse106 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse105 1)) (.cse107 (select .cse4 v_prenex_1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse105 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)) |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= v_DerPreprocessor_3 (select .cse106 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= (select .cse106 v_arrayElimCell_55) 0) (not (= .cse107 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse105) (not (= .cse107 .cse105))))))) .cse6) (and (or .cse7 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_33 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse108 (select .cse4 v_prenex_1))) (let ((.cse109 (store .cse3 .cse108 1))) (let ((.cse111 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|)) (.cse110 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse109 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse108 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse108) 0) (not (= .cse108 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse108 0)) (= |c_#valid| (store .cse109 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse110 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= 0 .cse111)) (not (= .cse108 .cse111)) (= (select .cse110 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse12 .cse17 (exists ((v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_32 Int) (v_arrayElimCell_56 Int)) (let ((.cse113 (select |c_#valid| v_arrayElimCell_56)) (.cse112 (select .cse4 v_prenex_1))) (let ((.cse114 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_32) .cse112 1) v_arrayElimCell_56 .cse113) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse112 1)) (.cse115 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse112) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse112 1) v_arrayElimCell_56 .cse113) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse112 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse112 0)) (= 1 (select .cse114 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse114 v_arrayElimCell_56) 0) (not (= 0 .cse115)) (not (= .cse112 .cse115))))))) .cse6) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_30 Int)) (let ((.cse116 (select .cse4 v_prenex_1))) (let ((.cse118 (store .cse3 .cse116 1))) (let ((.cse117 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse118 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse116 1)) (.cse119 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse116) 0) (not (= .cse116 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse117 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse118 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse117 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= 0 .cse119)) (not (= .cse116 .cse119))))))) .cse120 .cse121 (exists ((v_DerPreprocessor_29 Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_55 Int)) (let ((.cse123 (select |c_#valid| v_arrayElimCell_55)) (.cse122 (select .cse4 v_prenex_1))) (let ((.cse124 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_29) .cse122 1) v_arrayElimCell_55 .cse123) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse122 1)) (.cse125 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse122 1) v_arrayElimCell_55 .cse123) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse122) 0) (= (select .cse124 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse122 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= 0 (select .cse124 v_arrayElimCell_55)) (not (= 0 .cse125)) (not (= .cse122 .cse125)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_arrayElimCell_55 Int)) (let ((.cse126 (select .cse4 v_prenex_1))) (let ((.cse128 (store (store .cse3 .cse126 1) v_arrayElimCell_55 (select |c_#valid| v_arrayElimCell_55)))) (let ((.cse127 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse128 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse126 1)) (.cse129 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse126) 0) (= (select .cse127 v_arrayElimCell_55) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_20| v_arrayElimCell_55)) (= |c_#valid| (store .cse128 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse126 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse127 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= 0 .cse129)) (not (= .cse126 .cse129)))))))) .cse6) (and (or (and .cse22 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_39 Int) (v_prenex_1 Int)) (let ((.cse130 (select .cse4 v_prenex_1))) (let ((.cse132 (store .cse3 .cse130 1))) (let ((.cse131 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse132 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse130 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse130) 0) (not (= .cse130 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse130 0)) (= (select .cse131 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= |c_#valid| (store .cse132 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse131 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_DerPreprocessor_38 Int) (v_prenex_1 Int) (v_arrayElimCell_56 Int)) (let ((.cse134 (select |c_#valid| v_arrayElimCell_56)) (.cse133 (select .cse4 v_prenex_1))) (let ((.cse135 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_38) .cse133 1) v_arrayElimCell_56 .cse134) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse133 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse133) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse133 1) v_arrayElimCell_56 .cse134) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse135 v_arrayElimCell_56) 0) (not (= .cse133 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse133 0)) (= (select .cse135 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse26)) .cse30) .cse6) (and (or .cse59 (and (or .cse60 (exists ((v_DerPreprocessor_21 Int) (v_arrayElimCell_55 Int)) (let ((.cse136 (select |c_#valid| v_arrayElimCell_55))) (let ((.cse137 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_21) .cse64 1) v_arrayElimCell_55 .cse136) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= |c_#valid| (store (store .cse61 v_arrayElimCell_55 .cse136) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse137 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= 0 (select .cse137 v_arrayElimCell_55)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_22 Int)) (let ((.cse138 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse138 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse138 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0))))) .cse67)) .cse68) (and .cse139 (or .cse59 (and (or .cse60 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_37 Int)) (let ((.cse140 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse140 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse140 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0)))) (exists ((v_DerPreprocessor_36 Int) (v_arrayElimCell_55 Int)) (let ((.cse141 (select |c_#valid| v_arrayElimCell_55))) (let ((.cse142 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_36) .cse64 1) v_arrayElimCell_55 .cse141) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= |c_#valid| (store (store .cse61 v_arrayElimCell_55 .cse141) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse142 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse142 v_arrayElimCell_55) 0)))))) .cse67)) .cse68) (and .cse18 (or (and (or .cse60 (exists ((v_DerPreprocessor_51 Int) (v_arrayElimCell_55 Int)) (let ((.cse143 (select |c_#valid| v_arrayElimCell_55))) (let ((.cse144 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_51) .cse64 1) v_arrayElimCell_55 .cse143) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= |c_#valid| (store (store .cse61 v_arrayElimCell_55 .cse143) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse144 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse144 v_arrayElimCell_55) 0))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_52 Int)) (let ((.cse145 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse145 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse145 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0))))) .cse67) .cse59) .cse21 .cse68))))) (and .cse19 .cse20 .cse45) (and (or .cse120 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int) (v_DerPreprocessor_64 Int)) (let ((.cse155 (select .cse4 v_prenex_1))) (let ((.cse157 (store .cse3 .cse155 1))) (let ((.cse156 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse157 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse155 1)) (.cse158 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse155) 0) (= (select .cse156 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (not (= .cse155 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse157 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= 0 .cse158)) (not (= .cse155 .cse158))))))) .cse121) .cse6) (and (or .cse54 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_61 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_14| Int)) (let ((.cse159 (select .cse4 v_prenex_1))) (let ((.cse161 (store .cse3 .cse159 1))) (let ((.cse160 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse161 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse159 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse159) 0) (= (select .cse160 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (select .cse160 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse159 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse161 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (not (= .cse159 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_14|))))))))) .cse6) (and .cse19 .cse20 .cse139) (and .cse18 .cse19 .cse20) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_prenex_1 Int) (v_DerPreprocessor_6 Int)) (let ((.cse162 (select .cse4 v_prenex_1))) (let ((.cse164 (store .cse3 .cse162 1))) (let ((.cse163 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse164 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse162 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse162) 0) (= 0 (select .cse163 |v_ULTIMATE.start_freeData_~data#1.base_20|)) (not (= .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse164 |v_ULTIMATE.start_freeData_~data#1.base_20| 0)) (= (select .cse163 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (and .cse5 .cse89)) .cse6) (and .cse19 .cse20 .cse81) (and (or (and (exists ((|v_ULTIMATE.start_freeData_~data#1.base_20| Int) (v_DerPreprocessor_15 Int)) (let ((.cse165 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (select .cse165 |v_ULTIMATE.start_freeData_~data#1.base_20|) 0) (= (store .cse66 |v_ULTIMATE.start_freeData_~data#1.base_20| 0) |c_#valid|) (= (select .cse165 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) .cse67) (and .cse19 .cse20)) .cse68) (and .cse19 .cse20 .cse58) (and .cse19 .cse20 .cse21)))) (or .cse43 (not .cse6)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false