./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c -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 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:46:27,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:46:27,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:46:27,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:46:27,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:46:27,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:46:27,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:46:27,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:46:27,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:46:27,754 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:46:27,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:46:27,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:46:27,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:46:27,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:46:27,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:46:27,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:46:27,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:27,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:27,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:27,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:46:27,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:46:27,758 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 -> 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 [2025-01-09 22:46:27,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:46:27,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:46:27,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:46:27,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:46:27,960 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:46:27,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2025-01-09 22:46:29,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2c21526b/878e5230e141445b87ca2aa6c4709866/FLAG95b1a136e [2025-01-09 22:46:29,357 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:46:29,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2025-01-09 22:46:29,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2c21526b/878e5230e141445b87ca2aa6c4709866/FLAG95b1a136e [2025-01-09 22:46:29,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2c21526b/878e5230e141445b87ca2aa6c4709866 [2025-01-09 22:46:29,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:46:29,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:46:29,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:29,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:46:29,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:46:29,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:29,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406e16cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29, skipping insertion in model container [2025-01-09 22:46:29,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:29,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:46:29,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:29,879 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:46:29,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:29,932 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:46:29,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29 WrapperNode [2025-01-09 22:46:29,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:29,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:29,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:46:29,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:46:29,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:29,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:29,980 INFO L138 Inliner]: procedures = 18, calls = 199, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 402 [2025-01-09 22:46:29,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:29,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:46:29,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:46:29,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:46:29,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:29,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:29,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,010 INFO L175 MemorySlicer]: Split 180 memory accesses to 5 slices as follows [2, 7, 2, 41, 128]. 71 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 7, 2, 0, 0]. The 127 writes are split as follows [0, 0, 0, 0, 127]. [2025-01-09 22:46:30,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:46:30,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:46:30,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:46:30,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:46:30,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (1/1) ... [2025-01-09 22:46:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:30,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:46:30,052 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) [2025-01-09 22:46:30,055 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 [2025-01-09 22:46:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:46:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:46:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:46:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:46:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 22:46:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:46:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:46:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 22:46:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:46:30,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 22:46:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:46:30,200 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:46:30,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:46:35,369 INFO L? ?]: Removed 230 outVars from TransFormulas that were not future-live. [2025-01-09 22:46:35,370 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:46:35,381 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:46:35,381 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:46:35,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:35 BoogieIcfgContainer [2025-01-09 22:46:35,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:46:35,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:46:35,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:46:35,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:46:35,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:46:29" (1/3) ... [2025-01-09 22:46:35,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cc712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:35, skipping insertion in model container [2025-01-09 22:46:35,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:29" (2/3) ... [2025-01-09 22:46:35,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cc712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:35, skipping insertion in model container [2025-01-09 22:46:35,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:35" (3/3) ... [2025-01-09 22:46:35,388 INFO L128 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+cfa-reducer.c [2025-01-09 22:46:35,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:46:35,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aiob_4.c.v+cfa-reducer.c that has 1 procedures, 183 locations, 1 initial locations, 0 loop locations, and 86 error locations. [2025-01-09 22:46:35,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:46:35,429 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;@4a53061f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:46:35,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-01-09 22:46:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 182 states have internal predecessors, (187), 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) [2025-01-09 22:46:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:46:35,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:35,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:46:35,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:46:35,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash 925802, now seen corresponding path program 1 times [2025-01-09 22:46:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540702586] [2025-01-09 22:46:35,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:35,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:35,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:46:35,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:46:35,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:35,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:35,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:35,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540702586] [2025-01-09 22:46:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540702586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:35,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:35,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114329047] [2025-01-09 22:46:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:46:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:35,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:46:35,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:46:35,751 INFO L87 Difference]: Start difference. First operand has 183 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 182 states have internal predecessors, (187), 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) [2025-01-09 22:46:41,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:46:45,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:46:49,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:46:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:49,700 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2025-01-09 22:46:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:46:49,702 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 [2025-01-09 22:46:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:49,706 INFO L225 Difference]: With dead ends: 183 [2025-01-09 22:46:49,706 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:46:49,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:46:49,708 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 164 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:49,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 201 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2025-01-09 22:46:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:46:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 22:46:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 94 states have (on average 1.925531914893617) internal successors, (181), 179 states have internal predecessors, (181), 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) [2025-01-09 22:46:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2025-01-09 22:46:49,739 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 4 [2025-01-09 22:46:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:49,739 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2025-01-09 22:46:49,739 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) [2025-01-09 22:46:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2025-01-09 22:46:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:46:49,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:49,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:46:49,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:46:49,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:46:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2025-01-09 22:46:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365762467] [2025-01-09 22:46:49,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:49,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:46:49,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:46:49,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:49,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:46:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365762467] [2025-01-09 22:46:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365762467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:50,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:50,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:50,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710838187] [2025-01-09 22:46:50,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:50,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:46:50,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:50,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:46:50,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:46:50,238 INFO L87 Difference]: Start difference. First operand 180 states and 181 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) [2025-01-09 22:46:55,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:00,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:00,509 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2025-01-09 22:47:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:00,509 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 [2025-01-09 22:47:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:00,510 INFO L225 Difference]: With dead ends: 139 [2025-01-09 22:47:00,510 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 22:47:00,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:47:00,510 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 215 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:00,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 63 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2025-01-09 22:47:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 22:47:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-01-09 22:47:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 138 states have internal predecessors, (140), 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) [2025-01-09 22:47:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2025-01-09 22:47:00,518 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 4 [2025-01-09 22:47:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2025-01-09 22:47:00,518 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) [2025-01-09 22:47:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2025-01-09 22:47:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:47:00,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:00,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:47:00,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:47:00,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:00,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2025-01-09 22:47:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088609446] [2025-01-09 22:47:00,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:00,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:47:00,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:47:00,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:00,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:01,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088609446] [2025-01-09 22:47:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088609446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:01,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:01,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759770812] [2025-01-09 22:47:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:47:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:01,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:47:01,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:01,017 INFO L87 Difference]: Start difference. First operand 139 states and 140 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) [2025-01-09 22:47:06,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:10,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:10,881 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2025-01-09 22:47:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:10,882 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 [2025-01-09 22:47:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:10,882 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:47:10,883 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:47:10,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:10,883 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 80 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:10,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2025-01-09 22:47:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:47:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:47:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 97 states have internal predecessors, (99), 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) [2025-01-09 22:47:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2025-01-09 22:47:10,887 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 4 [2025-01-09 22:47:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:10,887 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-01-09 22:47:10,887 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) [2025-01-09 22:47:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2025-01-09 22:47:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 22:47:10,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:10,889 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:10,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:47:10,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:10,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1325804059, now seen corresponding path program 1 times [2025-01-09 22:47:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466352156] [2025-01-09 22:47:10,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:14,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 22:47:14,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 22:47:14,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:14,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:15,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:15,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466352156] [2025-01-09 22:47:15,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466352156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:15,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:15,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:47:15,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651871938] [2025-01-09 22:47:15,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:15,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:47:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:15,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:47:15,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:15,116 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2025-01-09 22:47:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:15,249 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2025-01-09 22:47:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2025-01-09 22:47:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:15,252 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:47:15,252 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:47:15,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:15,253 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:15,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:47:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:47:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 22:47:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 99 states have internal predecessors, (101), 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) [2025-01-09 22:47:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-01-09 22:47:15,261 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2025-01-09 22:47:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:15,262 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-01-09 22:47:15,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2025-01-09 22:47:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-01-09 22:47:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 22:47:15,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:15,263 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:15,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:47:15,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:15,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1325803866, now seen corresponding path program 1 times [2025-01-09 22:47:15,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:15,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728410975] [2025-01-09 22:47:15,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:19,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 22:47:19,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 22:47:19,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:19,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728410975] [2025-01-09 22:47:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728410975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776942868] [2025-01-09 22:47:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:19,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:47:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:47:19,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:19,937 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 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) [2025-01-09 22:47:24,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:25,550 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2025-01-09 22:47:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:25,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2025-01-09 22:47:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:25,552 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:47:25,552 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:47:25,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:47:25,552 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:25,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 183 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 22:47:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:47:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:47:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2025-01-09 22:47:25,555 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 91 [2025-01-09 22:47:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:25,556 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2025-01-09 22:47:25,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 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) [2025-01-09 22:47:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2025-01-09 22:47:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 22:47:25,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:25,557 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:47:25,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:25,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1325803865, now seen corresponding path program 1 times [2025-01-09 22:47:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575121442] [2025-01-09 22:47:25,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:29,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 22:47:29,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 22:47:29,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:29,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:30,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575121442] [2025-01-09 22:47:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575121442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:30,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:30,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:47:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217815834] [2025-01-09 22:47:30,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:47:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:47:30,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:47:30,393 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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) [2025-01-09 22:47:35,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:40,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:41,119 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2025-01-09 22:47:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:47:41,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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 91 [2025-01-09 22:47:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:41,120 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:47:41,120 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:47:41,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:47:41,121 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 16 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:41,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 233 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2025-01-09 22:47:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:47:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-01-09 22:47:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.041237113402062) internal successors, (101), 99 states have internal predecessors, (101), 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) [2025-01-09 22:47:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-01-09 22:47:41,131 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2025-01-09 22:47:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-01-09 22:47:41,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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) [2025-01-09 22:47:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-01-09 22:47:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 22:47:41,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:41,132 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:41,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:47:41,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:41,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1325178448, now seen corresponding path program 1 times [2025-01-09 22:47:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812922143] [2025-01-09 22:47:41,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:44,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 22:47:44,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 22:47:44,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:44,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:44,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:44,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812922143] [2025-01-09 22:47:44,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812922143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:44,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:44,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:47:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494742509] [2025-01-09 22:47:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:44,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:47:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:44,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:47:44,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:44,665 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2025-01-09 22:47:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:44,853 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2025-01-09 22:47:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:44,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2025-01-09 22:47:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:44,854 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:47:44,854 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:47:44,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:47:44,856 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 99 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:44,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 197 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:47:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:47:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2025-01-09 22:47:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.04) internal successors, (104), 102 states have internal predecessors, (104), 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) [2025-01-09 22:47:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2025-01-09 22:47:44,864 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 91 [2025-01-09 22:47:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:44,864 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2025-01-09 22:47:44,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2025-01-09 22:47:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2025-01-09 22:47:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 22:47:44,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:44,865 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:44,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:47:44,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1507777067, now seen corresponding path program 1 times [2025-01-09 22:47:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232114218] [2025-01-09 22:47:44,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:47,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 22:47:48,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 22:47:48,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232114218] [2025-01-09 22:47:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232114218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:53,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:47:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075882575] [2025-01-09 22:47:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:53,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:47:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:53,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:47:53,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:47:53,618 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) [2025-01-09 22:47:57,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:48:01,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:48:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:03,266 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2025-01-09 22:48:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:48:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 93 [2025-01-09 22:48:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:03,267 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:48:03,267 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:48:03,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:03,268 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:03,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 456 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-01-09 22:48:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:48:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-01-09 22:48:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 106 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) [2025-01-09 22:48:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2025-01-09 22:48:03,270 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 93 [2025-01-09 22:48:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2025-01-09 22:48:03,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) [2025-01-09 22:48:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2025-01-09 22:48:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 22:48:03,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:03,273 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:03,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:48:03,274 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:48:03,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash -703272880, now seen corresponding path program 1 times [2025-01-09 22:48:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512677769] [2025-01-09 22:48:03,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:07,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 22:48:07,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 22:48:07,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:07,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:08,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512677769] [2025-01-09 22:48:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512677769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863388543] [2025-01-09 22:48:08,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:08,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:08,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:08,093 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) [2025-01-09 22:48:08,095 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