./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-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+lh-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 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:46:31,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:46:31,254 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:31,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:46:31,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:46:31,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:46:31,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:46:31,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:46:31,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:46:31,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:46:31,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:46:31,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:46:31,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:46:31,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:46:31,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:46:31,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:31,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:31,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:31,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:46:31,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:46:31,274 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 -> 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 [2025-01-09 22:46:31,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:46:31,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:46:31,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:46:31,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:46:31,578 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:46:31,579 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+lh-reducer.c [2025-01-09 22:46:32,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfcfae43d/763d1f01678e4efca68745d4003718ce/FLAG2052098ac [2025-01-09 22:46:33,060 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:46:33,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c [2025-01-09 22:46:33,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfcfae43d/763d1f01678e4efca68745d4003718ce/FLAG2052098ac [2025-01-09 22:46:33,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfcfae43d/763d1f01678e4efca68745d4003718ce [2025-01-09 22:46:33,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:46:33,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:46:33,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:33,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:46:33,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:46:33,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:33" (1/1) ... [2025-01-09 22:46:33,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47308625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:33, skipping insertion in model container [2025-01-09 22:46:33,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:46:33" (1/1) ... [2025-01-09 22:46:33,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:46:33,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:33,309 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:46:33,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:46:33,367 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:46:33,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:33 WrapperNode [2025-01-09 22:46:33,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:46:33,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:33,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:46:33,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:46:33,375 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:33" (1/1) ... [2025-01-09 22:46:33,389 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:33" (1/1) ... [2025-01-09 22:46:33,421 INFO L138 Inliner]: procedures = 18, calls = 203, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 418 [2025-01-09 22:46:33,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:46:33,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:46:33,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:46:33,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:46:33,432 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:33" (1/1) ... [2025-01-09 22:46:33,433 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:33" (1/1) ... [2025-01-09 22:46:33,439 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:33" (1/1) ... [2025-01-09 22:46:33,477 INFO L175 MemorySlicer]: Split 180 memory accesses to 5 slices as follows [2, 41, 7, 2, 128]. 71 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 0, 7, 2, 0]. The 127 writes are split as follows [0, 0, 0, 0, 127]. [2025-01-09 22:46:33,478 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:33" (1/1) ... [2025-01-09 22:46:33,478 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:33" (1/1) ... [2025-01-09 22:46:33,499 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:33" (1/1) ... [2025-01-09 22:46:33,501 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:33" (1/1) ... [2025-01-09 22:46:33,506 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:33" (1/1) ... [2025-01-09 22:46:33,507 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:33" (1/1) ... [2025-01-09 22:46:33,512 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:33" (1/1) ... [2025-01-09 22:46:33,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:46:33,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:46:33,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:46:33,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:46:33,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:33" (1/1) ... [2025-01-09 22:46:33,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:46:33,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:46:33,552 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:33,555 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:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:46:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:46:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:46:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:46:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 22:46:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:46:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:46:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:46:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:46:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:46:33,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:46:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:46:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:46:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:46:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:46:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 22:46:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:46:33,698 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:46:33,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:46:38,905 INFO L? ?]: Removed 234 outVars from TransFormulas that were not future-live. [2025-01-09 22:46:38,905 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:46:38,925 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:46:38,926 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:46:38,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:38 BoogieIcfgContainer [2025-01-09 22:46:38,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:46:38,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:46:38,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:46:38,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:46:38,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:46:33" (1/3) ... [2025-01-09 22:46:38,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107c1761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:38, skipping insertion in model container [2025-01-09 22:46:38,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:46:33" (2/3) ... [2025-01-09 22:46:38,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107c1761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:46:38, skipping insertion in model container [2025-01-09 22:46:38,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:46:38" (3/3) ... [2025-01-09 22:46:38,935 INFO L128 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lh-reducer.c [2025-01-09 22:46:38,953 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:46:38,954 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aiob_4.c.v+lh-reducer.c that has 1 procedures, 183 locations, 1 initial locations, 0 loop locations, and 86 error locations. [2025-01-09 22:46:38,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:46:38,995 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;@123703cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:46:38,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-01-09 22:46:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 182 states have internal predecessors, (188), 0 states have call successors, (0), 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:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:46:39,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:39,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:46:39,001 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:39,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash 925805, now seen corresponding path program 1 times [2025-01-09 22:46:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218954723] [2025-01-09 22:46:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:39,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:46:39,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:46:39,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:39,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:39,341 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:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:39,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218954723] [2025-01-09 22:46:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218954723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615610281] [2025-01-09 22:46:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:39,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:46:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:39,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:46:39,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:46:39,367 INFO L87 Difference]: Start difference. First operand has 183 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 182 states have internal predecessors, (188), 0 states have call successors, (0), 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:44,856 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,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:46:53,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:46:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:46:53,982 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2025-01-09 22:46:53,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:46:53,984 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:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:46:53,989 INFO L225 Difference]: With dead ends: 183 [2025-01-09 22:46:53,989 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:46:53,990 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:53,991 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 164 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:46:53,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 200 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 3 Unknown, 0 Unchecked, 14.6s Time] [2025-01-09 22:46:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:46:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 22:46:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 94 states have (on average 1.9361702127659575) internal successors, (182), 179 states have internal predecessors, (182), 0 states have call successors, (0), 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:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2025-01-09 22:46:54,025 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 4 [2025-01-09 22:46:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:46:54,025 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2025-01-09 22:46:54,025 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:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2025-01-09 22:46:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:46:54,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:46:54,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:46:54,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:46:54,026 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:54,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:46:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2025-01-09 22:46:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:46:54,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861608439] [2025-01-09 22:46:54,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:46:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:46:54,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:46:54,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:46:54,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:46:54,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:46:54,588 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:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:46:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861608439] [2025-01-09 22:46:54,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861608439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:46:54,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:46:54,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:46:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613561308] [2025-01-09 22:46:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:46:54,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:46:54,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:46:54,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:46:54,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:46:54,591 INFO L87 Difference]: Start difference. First operand 180 states and 182 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:00,113 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:04,404 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:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:04,930 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2025-01-09 22:47:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:04,931 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:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:04,932 INFO L225 Difference]: With dead ends: 139 [2025-01-09 22:47:04,932 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 22:47:04,932 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:04,933 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 214 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:04,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 61 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2025-01-09 22:47:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 22:47:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-01-09 22:47:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.5) internal successors, (141), 138 states have internal predecessors, (141), 0 states have call successors, (0), 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:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2025-01-09 22:47:04,938 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 4 [2025-01-09 22:47:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:04,938 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2025-01-09 22:47:04,939 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:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2025-01-09 22:47:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:47:04,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:04,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:47:04,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:47:04,939 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:04,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2025-01-09 22:47:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141861652] [2025-01-09 22:47:04,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:05,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:47:05,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:47:05,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:05,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:05,497 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:05,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141861652] [2025-01-09 22:47:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141861652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:05,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594964848] [2025-01-09 22:47:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:05,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:47:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:05,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:47:05,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:05,499 INFO L87 Difference]: Start difference. First operand 139 states and 141 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:10,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:14,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:15,151 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2025-01-09 22:47:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:15,152 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:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:15,153 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:47:15,153 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:47:15,153 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:15,154 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:15,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 121 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2025-01-09 22:47:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:47:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:47:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 97 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:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2025-01-09 22:47:15,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 4 [2025-01-09 22:47:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:15,158 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-01-09 22:47:15,159 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:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2025-01-09 22:47:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 22:47:15,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:15,160 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] [2025-01-09 22:47:15,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:47:15,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:15,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1289678943, now seen corresponding path program 1 times [2025-01-09 22:47:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:15,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875754885] [2025-01-09 22:47:15,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:18,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 22:47:18,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 22:47:18,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:18,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:19,648 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,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875754885] [2025-01-09 22:47:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875754885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:47:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513679967] [2025-01-09 22:47:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:19,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:47:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:19,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:47:19,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:19,649 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:19,856 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2025-01-09 22:47:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 22:47:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:19,858 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:47:19,858 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:47:19,858 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:19,859 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 103 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 203 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:19,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 203 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:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:47:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2025-01-09 22:47:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 100 states have internal predecessors, (103), 0 states have call successors, (0), 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:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2025-01-09 22:47:19,863 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 90 [2025-01-09 22:47:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:19,864 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2025-01-09 22:47:19,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2025-01-09 22:47:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 22:47:19,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:19,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] [2025-01-09 22:47:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:47:19,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:19,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1289693814, now seen corresponding path program 1 times [2025-01-09 22:47:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008132678] [2025-01-09 22:47:19,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:23,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 22:47:23,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 22:47:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:24,171 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:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008132678] [2025-01-09 22:47:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008132678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461692382] [2025-01-09 22:47:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:24,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:24,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:24,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:24,172 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:24,213 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2025-01-09 22:47:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 22:47:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:24,216 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:47:24,216 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:47:24,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:24,216 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:24,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:47:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:47:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 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,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2025-01-09 22:47:24,219 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 90 [2025-01-09 22:47:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:24,220 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2025-01-09 22:47:24,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2025-01-09 22:47:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 22:47:24,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:24,221 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] [2025-01-09 22:47:24,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:47:24,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:47:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1289693773, now seen corresponding path program 1 times [2025-01-09 22:47:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034337962] [2025-01-09 22:47:24,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:27,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 22:47:27,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 22:47:27,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:27,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:28,338 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:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034337962] [2025-01-09 22:47:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034337962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:28,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665714039] [2025-01-09 22:47:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:28,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:47:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:28,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:47:28,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:47:28,341 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:33,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:33,957 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2025-01-09 22:47:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:47:33,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 22:47:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:33,958 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:47:33,958 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:47:33,958 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:33,959 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 7 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:33,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 22:47:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:47:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 22:47:33,967 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:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-01-09 22:47:33,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 90 [2025-01-09 22:47:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:33,967 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-01-09 22:47:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-01-09 22:47:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 22:47:33,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:33,969 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] [2025-01-09 22:47:33,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:47:33,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:33,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1289693772, now seen corresponding path program 1 times [2025-01-09 22:47:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990250119] [2025-01-09 22:47:33,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:37,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 22:47:37,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 22:47:37,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:37,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:38,622 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:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990250119] [2025-01-09 22:47:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990250119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:38,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:47:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687926924] [2025-01-09 22:47:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:38,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:47:38,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:38,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:47:38,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:47:38,624 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:44,097 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:48,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:47:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:49,135 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2025-01-09 22:47:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:47:49,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 22:47:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:49,136 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:47:49,136 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:47:49,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:47:49,138 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:49,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2025-01-09 22:47:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:47:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:47:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.0309278350515463) 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:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2025-01-09 22:47:49,143 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 90 [2025-01-09 22:47:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:49,144 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2025-01-09 22:47:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2025-01-09 22:47:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 22:47:49,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:49,148 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] [2025-01-09 22:47:49,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:47:49,148 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:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1849837889, now seen corresponding path program 1 times [2025-01-09 22:47:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875541639] [2025-01-09 22:47:49,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 22:47:52,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 22:47:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:57,500 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:57,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875541639] [2025-01-09 22:47:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875541639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:57,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:57,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:47:57,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958735788] [2025-01-09 22:47:57,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:57,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:47:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:57,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:47:57,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:47:57,506 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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:01,593 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:05,885 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:48:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:07,071 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2025-01-09 22:48:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:48:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 22:48:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:07,073 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:48:07,073 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:48:07,073 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:07,074 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:07,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 450 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-01-09 22:48:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:48:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-01-09 22:48:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.03) internal successors, (103), 101 states have internal predecessors, (103), 0 states have call successors, (0), 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:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2025-01-09 22:48:07,077 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 92 [2025-01-09 22:48:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:07,077 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2025-01-09 22:48:07,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2025-01-09 22:48:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 22:48:07,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:07,078 INFO L218 NwaCegarLoop]: trace histogram [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:07,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:48:07,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2025-01-09 22:48:07,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2137791852, now seen corresponding path program 1 times [2025-01-09 22:48:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103425476] [2025-01-09 22:48:07,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:10,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 22:48:10,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 22:48:10,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:11,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:11,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103425476] [2025-01-09 22:48:11,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103425476] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:11,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034911205] [2025-01-09 22:48:11,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:11,023 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:11,025 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