./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:27:26,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:27:26,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:27:26,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:27:26,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:27:26,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:27:26,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:27:26,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:27:26,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:27:26,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:27:26,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:27:26,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:27:26,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:27:26,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:27:26,299 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:27:26,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:27:26,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:27:26,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:27:26,299 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:27:26,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:27:26,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:27:26,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:27:26,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:27:26,301 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2025-03-09 00:27:26,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:27:26,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:27:26,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:27:26,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:27:26,572 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:27:26,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 00:27:27,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c1f72589/6e3ded3107e549a7bc6293810c9ce132/FLAGa46d89541 [2025-03-09 00:27:28,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:27:28,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 00:27:28,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c1f72589/6e3ded3107e549a7bc6293810c9ce132/FLAGa46d89541 [2025-03-09 00:27:28,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c1f72589/6e3ded3107e549a7bc6293810c9ce132 [2025-03-09 00:27:28,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:27:28,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:27:28,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:27:28,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:27:28,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:27:28,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:27:28" (1/1) ... [2025-03-09 00:27:28,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640aa9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:28, skipping insertion in model container [2025-03-09 00:27:28,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:27:28" (1/1) ... [2025-03-09 00:27:28,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:27:28,792 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:27:28,794 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:27:28,804 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:27:28,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:27:28,837 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:27:28,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:27:29,022 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:27:29,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29 WrapperNode [2025-03-09 00:27:29,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:27:29,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:27:29,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:27:29,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:27:29,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,095 INFO L138 Inliner]: procedures = 524, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 486 [2025-03-09 00:27:29,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:27:29,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:27:29,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:27:29,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:27:29,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,147 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 2, 355, 2, 6, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 0, 355, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 2, 2, 1]. [2025-03-09 00:27:29,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:27:29,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:27:29,196 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:27:29,196 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:27:29,197 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (1/1) ... [2025-03-09 00:27:29,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:27:29,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:29,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:27:29,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 00:27:29,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:27:29,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:27:29,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 00:27:29,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 00:27:29,482 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:27:29,484 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:27:29,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1793: havoc gethostid_#t~nondet74#1; [2025-03-09 00:27:29,838 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-03-09 00:27:29,838 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:27:29,847 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:27:29,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:27:29,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:27:29 BoogieIcfgContainer [2025-03-09 00:27:29,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:27:29,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:27:29,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:27:29,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:27:29,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:27:28" (1/3) ... [2025-03-09 00:27:29,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd3740b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:27:29, skipping insertion in model container [2025-03-09 00:27:29,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:29" (2/3) ... [2025-03-09 00:27:29,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd3740b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:27:29, skipping insertion in model container [2025-03-09 00:27:29,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:27:29" (3/3) ... [2025-03-09 00:27:29,855 INFO L128 eAbstractionObserver]: Analyzing ICFG hostid.i [2025-03-09 00:27:29,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:27:29,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hostid.i that has 2 procedures, 92 locations, 1 initial locations, 5 loop locations, and 38 error locations. [2025-03-09 00:27:29,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:27:29,937 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;@6d68c978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:27:29,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-09 00:27:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 89 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:27:29,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:29,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:27:29,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 129057, now seen corresponding path program 1 times [2025-03-09 00:27:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906624982] [2025-03-09 00:27:29,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:30,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:27:30,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:27:30,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:30,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906624982] [2025-03-09 00:27:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906624982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:30,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:30,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939000173] [2025-03-09 00:27:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:30,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:30,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:30,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:30,614 INFO L87 Difference]: Start difference. First operand has 92 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 89 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:27:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:30,705 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2025-03-09 00:27:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:30,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-09 00:27:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:30,713 INFO L225 Difference]: With dead ends: 56 [2025-03-09 00:27:30,714 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 00:27:30,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:30,720 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 48 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:30,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 37 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 00:27:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-09 00:27:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 53 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-03-09 00:27:30,748 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 3 [2025-03-09 00:27:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-03-09 00:27:30,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:27:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-03-09 00:27:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:27:30,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:30,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:27:30,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:27:30,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:30,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 129058, now seen corresponding path program 1 times [2025-03-09 00:27:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518125906] [2025-03-09 00:27:30,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:30,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:30,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:27:30,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:27:30,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:30,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:31,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:31,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518125906] [2025-03-09 00:27:31,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518125906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:31,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:31,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278360174] [2025-03-09 00:27:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:31,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:31,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:31,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:31,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:31,107 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:27:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:31,183 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-03-09 00:27:31,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:31,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-09 00:27:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:31,184 INFO L225 Difference]: With dead ends: 55 [2025-03-09 00:27:31,185 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 00:27:31,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:31,186 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:31,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 00:27:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 00:27:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.696969696969697) internal successors, (56), 52 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-03-09 00:27:31,193 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 3 [2025-03-09 00:27:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:31,193 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-03-09 00:27:31,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:27:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-03-09 00:27:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:27:31,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:31,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:27:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:27:31,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash -450165698, now seen corresponding path program 1 times [2025-03-09 00:27:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626203490] [2025-03-09 00:27:31,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:31,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:27:31,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:27:31,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:31,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:31,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626203490] [2025-03-09 00:27:31,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626203490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:31,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:31,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100383886] [2025-03-09 00:27:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:31,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:27:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:31,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:27:31,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:27:31,551 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-09 00:27:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:31,672 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-09 00:27:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:27:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-09 00:27:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:31,674 INFO L225 Difference]: With dead ends: 58 [2025-03-09 00:27:31,674 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 00:27:31,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:27:31,674 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:31,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 00:27:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-09 00:27:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 54 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-09 00:27:31,682 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 6 [2025-03-09 00:27:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:31,682 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-09 00:27:31,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-09 00:27:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-09 00:27:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:27:31,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:31,683 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:31,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:27:31,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:31,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1998381091, now seen corresponding path program 1 times [2025-03-09 00:27:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:31,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073518640] [2025-03-09 00:27:31,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:31,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:27:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:27:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:31,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073518640] [2025-03-09 00:27:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073518640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47477166] [2025-03-09 00:27:32,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:32,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:32,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:32,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:32,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:27:32,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:27:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:27:32,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:32,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:32,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:27:32,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:32,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:32,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-09 00:27:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47477166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:32,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:27:32,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15122192] [2025-03-09 00:27:32,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:32,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:27:32,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:32,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:27:32,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:27:32,448 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:32,583 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-09 00:27:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:27:32,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:27:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:32,584 INFO L225 Difference]: With dead ends: 61 [2025-03-09 00:27:32,584 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 00:27:32,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:27:32,585 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 101 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:32,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 161 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 00:27:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-09 00:27:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.55) internal successors, (62), 58 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-09 00:27:32,588 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 9 [2025-03-09 00:27:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:32,588 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-09 00:27:32,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-09 00:27:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 00:27:32,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:32,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:32,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:32,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:32,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:32,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1084613940, now seen corresponding path program 1 times [2025-03-09 00:27:32,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:32,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750142351] [2025-03-09 00:27:32,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:32,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:32,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:27:32,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:27:32,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:32,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750142351] [2025-03-09 00:27:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750142351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607161502] [2025-03-09 00:27:33,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:33,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:33,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:33,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:33,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:27:33,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:27:33,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:27:33,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:33,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:33,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:27:33,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:33,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607161502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:33,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:33,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 00:27:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959162478] [2025-03-09 00:27:33,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:33,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:27:33,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:33,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:27:33,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:33,476 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:33,530 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-03-09 00:27:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:27:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 00:27:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:33,533 INFO L225 Difference]: With dead ends: 76 [2025-03-09 00:27:33,533 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 00:27:33,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:33,533 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:33,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 207 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 00:27:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 00:27:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.4) internal successors, (77), 73 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-09 00:27:33,539 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 21 [2025-03-09 00:27:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-09 00:27:33,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-09 00:27:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:27:33,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:33,540 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:33,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:27:33,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:33,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash 658158733, now seen corresponding path program 2 times [2025-03-09 00:27:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003484979] [2025-03-09 00:27:33,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:33,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:27:33,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-03-09 00:27:33,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:33,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-09 00:27:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003484979] [2025-03-09 00:27:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003484979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:33,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:33,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454765807] [2025-03-09 00:27:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:33,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:33,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:33,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:33,958 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:34,013 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2025-03-09 00:27:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:34,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-09 00:27:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:34,014 INFO L225 Difference]: With dead ends: 71 [2025-03-09 00:27:34,014 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 00:27:34,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:34,014 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:34,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 00:27:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 00:27:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.309090909090909) internal successors, (72), 68 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2025-03-09 00:27:34,021 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 36 [2025-03-09 00:27:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:34,022 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2025-03-09 00:27:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2025-03-09 00:27:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:27:34,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:34,023 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:34,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:27:34,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:34,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash 658158734, now seen corresponding path program 1 times [2025-03-09 00:27:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837975795] [2025-03-09 00:27:34,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:34,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 00:27:34,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:27:34,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:34,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837975795] [2025-03-09 00:27:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837975795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097060477] [2025-03-09 00:27:34,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:34,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:34,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:34,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:34,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:27:34,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 00:27:34,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:27:34,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:34,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:34,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:27:34,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:34,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097060477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:34,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:34,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-09 00:27:34,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232827529] [2025-03-09 00:27:34,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:34,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:27:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:34,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:27:34,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:34,701 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:34,743 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-09 00:27:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:34,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-09 00:27:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:34,745 INFO L225 Difference]: With dead ends: 77 [2025-03-09 00:27:34,745 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 00:27:34,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:34,746 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:34,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 233 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 00:27:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 00:27:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.278688524590164) internal successors, (78), 74 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-09 00:27:34,752 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 36 [2025-03-09 00:27:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:34,752 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-09 00:27:34,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-09 00:27:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 00:27:34,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:34,755 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:34,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:34,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:34,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:34,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash 106431534, now seen corresponding path program 2 times [2025-03-09 00:27:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:34,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863634] [2025-03-09 00:27:34,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:34,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 00:27:35,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-09 00:27:35,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:35,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863634] [2025-03-09 00:27:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:27:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515607157] [2025-03-09 00:27:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:27:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:35,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:27:35,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:35,461 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:35,533 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-03-09 00:27:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:27:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-03-09 00:27:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:35,534 INFO L225 Difference]: With dead ends: 86 [2025-03-09 00:27:35,534 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 00:27:35,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:35,535 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 108 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:35,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 00:27:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2025-03-09 00:27:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 73 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-09 00:27:35,540 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 42 [2025-03-09 00:27:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:35,540 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-09 00:27:35,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-09 00:27:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:27:35,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:35,542 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:35,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:27:35,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:35,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1015987750, now seen corresponding path program 1 times [2025-03-09 00:27:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:35,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88275289] [2025-03-09 00:27:35,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:35,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:27:35,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:27:35,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:35,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:35,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88275289] [2025-03-09 00:27:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88275289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:27:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738274685] [2025-03-09 00:27:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:35,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:35,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:35,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:35,960 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:36,020 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-03-09 00:27:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:27:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-09 00:27:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:36,021 INFO L225 Difference]: With dead ends: 95 [2025-03-09 00:27:36,021 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 00:27:36,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:36,022 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 139 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:36,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 51 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 00:27:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2025-03-09 00:27:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.32) internal successors, (99), 87 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2025-03-09 00:27:36,026 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 45 [2025-03-09 00:27:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:36,026 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2025-03-09 00:27:36,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2025-03-09 00:27:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:27:36,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:36,027 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:36,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:27:36,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:36,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1015986821, now seen corresponding path program 1 times [2025-03-09 00:27:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260940134] [2025-03-09 00:27:36,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:36,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:27:36,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:27:36,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:36,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:36,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:36,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260940134] [2025-03-09 00:27:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260940134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:36,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:36,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:36,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435503593] [2025-03-09 00:27:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:36,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:27:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:36,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:27:36,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:27:36,189 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:36,244 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2025-03-09 00:27:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:27:36,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-09 00:27:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:36,245 INFO L225 Difference]: With dead ends: 89 [2025-03-09 00:27:36,245 INFO L226 Difference]: Without dead ends: 89 [2025-03-09 00:27:36,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:27:36,246 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:36,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 66 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-09 00:27:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-09 00:27:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 86 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2025-03-09 00:27:36,249 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 45 [2025-03-09 00:27:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:36,249 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2025-03-09 00:27:36,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2025-03-09 00:27:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:27:36,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:36,250 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:36,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:27:36,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1015986822, now seen corresponding path program 1 times [2025-03-09 00:27:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:36,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748578047] [2025-03-09 00:27:36,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:36,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:27:36,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:27:36,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:36,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:36,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:36,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748578047] [2025-03-09 00:27:36,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748578047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:36,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:36,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:27:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137342451] [2025-03-09 00:27:36,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:36,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:36,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:36,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:36,568 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:36,622 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-03-09 00:27:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:36,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-09 00:27:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:36,623 INFO L225 Difference]: With dead ends: 94 [2025-03-09 00:27:36,624 INFO L226 Difference]: Without dead ends: 94 [2025-03-09 00:27:36,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:36,624 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:36,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-09 00:27:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2025-03-09 00:27:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 86 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2025-03-09 00:27:36,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 45 [2025-03-09 00:27:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:36,638 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2025-03-09 00:27:36,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2025-03-09 00:27:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:27:36,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:36,639 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:36,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:27:36,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:36,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 656543112, now seen corresponding path program 1 times [2025-03-09 00:27:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:36,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884611727] [2025-03-09 00:27:36,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:36,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:27:36,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:27:36,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:36,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884611727] [2025-03-09 00:27:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884611727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:36,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:36,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030421257] [2025-03-09 00:27:36,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:36,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:36,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:36,861 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:36,888 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-03-09 00:27:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:36,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-09 00:27:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:36,889 INFO L225 Difference]: With dead ends: 88 [2025-03-09 00:27:36,889 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 00:27:36,890 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-03-09 00:27:36,890 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:36,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 00:27:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-09 00:27:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 85 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2025-03-09 00:27:36,893 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2025-03-09 00:27:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:36,893 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2025-03-09 00:27:36,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2025-03-09 00:27:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:27:36,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:36,894 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:36,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:27:36,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash 656543113, now seen corresponding path program 1 times [2025-03-09 00:27:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503973782] [2025-03-09 00:27:36,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:36,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:27:36,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:27:36,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:36,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:37,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503973782] [2025-03-09 00:27:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503973782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:37,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:37,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:27:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470263314] [2025-03-09 00:27:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:37,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:27:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:37,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:27:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:27:37,532 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:37,732 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-03-09 00:27:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:27:37,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-09 00:27:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:37,732 INFO L225 Difference]: With dead ends: 101 [2025-03-09 00:27:37,732 INFO L226 Difference]: Without dead ends: 101 [2025-03-09 00:27:37,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:27:37,733 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 129 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:37,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 110 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-09 00:27:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2025-03-09 00:27:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 85 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2025-03-09 00:27:37,739 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 48 [2025-03-09 00:27:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:37,739 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2025-03-09 00:27:37,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2025-03-09 00:27:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:27:37,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:37,740 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:37,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:27:37,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:37,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -205175778, now seen corresponding path program 1 times [2025-03-09 00:27:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601604471] [2025-03-09 00:27:37,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:37,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:27:37,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:27:37,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:37,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:38,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601604471] [2025-03-09 00:27:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601604471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:38,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:27:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54113629] [2025-03-09 00:27:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:38,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:27:38,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:38,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:27:38,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:27:38,014 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:38,086 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-03-09 00:27:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:27:38,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 00:27:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:38,087 INFO L225 Difference]: With dead ends: 87 [2025-03-09 00:27:38,087 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 00:27:38,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:38,088 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:38,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 99 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 00:27:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-09 00:27:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 84 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-03-09 00:27:38,091 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 51 [2025-03-09 00:27:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:38,091 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-03-09 00:27:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-03-09 00:27:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:27:38,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:38,092 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:38,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:27:38,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:38,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash -205175777, now seen corresponding path program 1 times [2025-03-09 00:27:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934607663] [2025-03-09 00:27:38,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:38,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:27:38,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:27:38,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:38,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:38,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934607663] [2025-03-09 00:27:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934607663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:38,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:27:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860916399] [2025-03-09 00:27:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:27:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:38,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:27:38,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:27:38,525 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:38,604 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2025-03-09 00:27:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:27:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 00:27:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:38,605 INFO L225 Difference]: With dead ends: 86 [2025-03-09 00:27:38,605 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 00:27:38,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:38,605 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:38,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 00:27:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-09 00:27:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.2) internal successors, (90), 83 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2025-03-09 00:27:38,607 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 51 [2025-03-09 00:27:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:38,607 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2025-03-09 00:27:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2025-03-09 00:27:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 00:27:38,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:38,612 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:38,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:27:38,612 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1228528210, now seen corresponding path program 1 times [2025-03-09 00:27:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948751908] [2025-03-09 00:27:38,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:38,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 00:27:38,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 00:27:38,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:38,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948751908] [2025-03-09 00:27:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948751908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:38,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524963002] [2025-03-09 00:27:38,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:38,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:38,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:38,740 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:38,750 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2025-03-09 00:27:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:38,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 00:27:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:38,753 INFO L225 Difference]: With dead ends: 98 [2025-03-09 00:27:38,753 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 00:27:38,753 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-03-09 00:27:38,754 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:38,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 00:27:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-03-09 00:27:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 85 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-03-09 00:27:38,758 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 55 [2025-03-09 00:27:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:38,759 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-03-09 00:27:38,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-03-09 00:27:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:27:38,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:38,762 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 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-03-09 00:27:38,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:27:38,762 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -570084802, now seen corresponding path program 1 times [2025-03-09 00:27:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936867073] [2025-03-09 00:27:38,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:38,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:38,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:27:38,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:27:38,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936867073] [2025-03-09 00:27:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936867073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:27:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939211876] [2025-03-09 00:27:38,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:27:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:27:38,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:27:38,930 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:38,985 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2025-03-09 00:27:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:27:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 00:27:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:38,986 INFO L225 Difference]: With dead ends: 87 [2025-03-09 00:27:38,986 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 00:27:38,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:38,987 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:38,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 00:27:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-09 00:27:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 84 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2025-03-09 00:27:38,990 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 56 [2025-03-09 00:27:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:38,990 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2025-03-09 00:27:38,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2025-03-09 00:27:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:27:38,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:38,993 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 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-03-09 00:27:38,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:27:38,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:38,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash -570084801, now seen corresponding path program 1 times [2025-03-09 00:27:38,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:38,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780621243] [2025-03-09 00:27:38,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:39,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:27:39,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:27:39,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:39,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:39,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780621243] [2025-03-09 00:27:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780621243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:27:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351949355] [2025-03-09 00:27:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:39,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:27:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:39,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:27:39,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:39,512 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:39,629 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-03-09 00:27:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:27:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 00:27:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:39,630 INFO L225 Difference]: With dead ends: 95 [2025-03-09 00:27:39,630 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 00:27:39,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:27:39,630 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:39,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 00:27:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-03-09 00:27:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 90 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2025-03-09 00:27:39,633 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 56 [2025-03-09 00:27:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:39,633 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2025-03-09 00:27:39,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2025-03-09 00:27:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 00:27:39,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:39,634 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-09 00:27:39,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:27:39,634 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash 395419931, now seen corresponding path program 1 times [2025-03-09 00:27:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38017362] [2025-03-09 00:27:39,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:39,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:27:39,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:27:39,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:39,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38017362] [2025-03-09 00:27:39,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38017362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:39,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178955048] [2025-03-09 00:27:39,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:39,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:39,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:39,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:39,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:27:39,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:27:40,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:27:40,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:40,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:27:40,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:40,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:40,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178955048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:40,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:40,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:27:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386005507] [2025-03-09 00:27:40,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:40,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:27:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:40,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:27:40,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:40,049 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:40,074 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-03-09 00:27:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:40,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-03-09 00:27:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:40,075 INFO L225 Difference]: With dead ends: 120 [2025-03-09 00:27:40,075 INFO L226 Difference]: Without dead ends: 120 [2025-03-09 00:27:40,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:27:40,076 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:40,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 159 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-09 00:27:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2025-03-09 00:27:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 107 states have (on average 1.1869158878504673) internal successors, (127), 114 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2025-03-09 00:27:40,080 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 60 [2025-03-09 00:27:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:40,081 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2025-03-09 00:27:40,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2025-03-09 00:27:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 00:27:40,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:40,082 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:40,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:40,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:40,283 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:40,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash -626637674, now seen corresponding path program 1 times [2025-03-09 00:27:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:40,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931649085] [2025-03-09 00:27:40,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:40,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:27:40,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:27:40,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:40,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931649085] [2025-03-09 00:27:41,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931649085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763105134] [2025-03-09 00:27:41,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:41,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:41,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:41,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:41,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:27:41,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:27:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:27:41,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:41,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:41,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 00:27:41,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:41,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 00:27:41,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 00:27:41,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 00:27:41,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2025-03-09 00:27:41,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-03-09 00:27:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:41,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763105134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:41,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:41,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-09 00:27:41,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813539279] [2025-03-09 00:27:41,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:41,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:27:41,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:41,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:27:41,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-03-09 00:27:41,732 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:42,021 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2025-03-09 00:27:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-03-09 00:27:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:42,023 INFO L225 Difference]: With dead ends: 116 [2025-03-09 00:27:42,023 INFO L226 Difference]: Without dead ends: 116 [2025-03-09 00:27:42,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:27:42,024 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:42,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 213 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:42,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-09 00:27:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-09 00:27:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 113 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2025-03-09 00:27:42,028 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 61 [2025-03-09 00:27:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:42,028 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2025-03-09 00:27:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2025-03-09 00:27:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 00:27:42,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:42,029 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:42,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:42,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:42,233 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:42,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2071395730, now seen corresponding path program 2 times [2025-03-09 00:27:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478437337] [2025-03-09 00:27:42,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:42,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 00:27:42,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:27:42,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:42,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478437337] [2025-03-09 00:27:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478437337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52766962] [2025-03-09 00:27:42,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:42,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:42,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:42,505 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:42,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:27:42,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 00:27:42,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:27:42,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:27:42,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:42,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:27:42,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:42,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52766962] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:42,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:42,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:27:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103865446] [2025-03-09 00:27:42,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:42,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:27:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:42,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:27:42,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:42,907 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:42,949 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2025-03-09 00:27:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-03-09 00:27:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:42,951 INFO L225 Difference]: With dead ends: 185 [2025-03-09 00:27:42,951 INFO L226 Difference]: Without dead ends: 185 [2025-03-09 00:27:42,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:42,952 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:42,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 249 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:27:42,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-09 00:27:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2025-03-09 00:27:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 167 states have (on average 1.1197604790419162) internal successors, (187), 173 states have internal predecessors, (187), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2025-03-09 00:27:42,962 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 75 [2025-03-09 00:27:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:42,962 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2025-03-09 00:27:42,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2025-03-09 00:27:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:27:42,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:42,963 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:42,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:27:43,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:43,164 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash 483243634, now seen corresponding path program 3 times [2025-03-09 00:27:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:43,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881943596] [2025-03-09 00:27:43,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:27:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:43,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-09 00:27:43,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-09 00:27:43,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:27:43,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:43,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881943596] [2025-03-09 00:27:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881943596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737180837] [2025-03-09 00:27:43,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:27:43,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:43,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:43,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:43,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:27:43,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-09 00:27:43,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-09 00:27:43,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:27:43,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:43,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 00:27:43,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:44,051 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:44,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:27:44,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 00:27:44,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 00:27:44,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-03-09 00:27:44,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:44,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 00:27:44,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:44,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:27:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:44,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:45,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:27:45,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2025-03-09 00:27:45,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-03-09 00:27:45,891 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:27:45,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2025-03-09 00:27:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737180837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:45,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2025-03-09 00:27:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166398172] [2025-03-09 00:27:45,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:45,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:27:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:45,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:27:45,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-03-09 00:27:45,925 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:46,247 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2025-03-09 00:27:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-03-09 00:27:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:46,251 INFO L225 Difference]: With dead ends: 172 [2025-03-09 00:27:46,251 INFO L226 Difference]: Without dead ends: 172 [2025-03-09 00:27:46,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2025-03-09 00:27:46,252 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 95 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:46,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 255 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:27:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-09 00:27:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 117. [2025-03-09 00:27:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 114 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2025-03-09 00:27:46,260 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 105 [2025-03-09 00:27:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:46,260 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2025-03-09 00:27:46,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:27:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2025-03-09 00:27:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:27:46,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:46,260 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 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-03-09 00:27:46,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 00:27:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:46,461 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:46,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 483242706, now seen corresponding path program 1 times [2025-03-09 00:27:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237816053] [2025-03-09 00:27:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:46,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:27:46,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:27:46,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:46,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:47,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:47,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237816053] [2025-03-09 00:27:47,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237816053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:47,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357179159] [2025-03-09 00:27:47,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:47,129 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:47,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:27:47,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 00:27:47,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 00:27:47,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:47,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:47,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 00:27:47,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:47,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:47,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:27:47,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 00:27:47,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-09 00:27:47,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-03-09 00:27:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-09 00:27:47,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:48,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-03-09 00:27:48,089 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-09 00:27:48,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-03-09 00:27:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:48,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357179159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:48,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:48,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2025-03-09 00:27:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343807503] [2025-03-09 00:27:48,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:48,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 00:27:48,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:48,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 00:27:48,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-09 00:27:48,122 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:48,351 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2025-03-09 00:27:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2025-03-09 00:27:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:48,352 INFO L225 Difference]: With dead ends: 171 [2025-03-09 00:27:48,352 INFO L226 Difference]: Without dead ends: 171 [2025-03-09 00:27:48,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:27:48,353 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 102 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:48,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 155 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:27:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-09 00:27:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 116. [2025-03-09 00:27:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 113 states have internal predecessors, (117), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2025-03-09 00:27:48,361 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 105 [2025-03-09 00:27:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:48,361 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2025-03-09 00:27:48,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2025-03-09 00:27:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 00:27:48,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:48,362 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:48,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:27:48,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 00:27:48,562 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:48,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash -419257923, now seen corresponding path program 1 times [2025-03-09 00:27:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193054092] [2025-03-09 00:27:48,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:48,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 00:27:48,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 00:27:48,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:48,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193054092] [2025-03-09 00:27:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193054092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874589402] [2025-03-09 00:27:49,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:49,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:49,469 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:49,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:27:49,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 00:27:49,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 00:27:49,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:49,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:49,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 00:27:49,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:49,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:27:49,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-09 00:27:49,826 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-09 00:27:49,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2025-03-09 00:27:49,989 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2025-03-09 00:27:49,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2025-03-09 00:27:50,017 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:50,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:27:50,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 00:27:51,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-09 00:27:51,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:27:51,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-03-09 00:27:51,701 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:27:51,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 00:27:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-09 00:27:51,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:52,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:27:52,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-09 00:27:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:27:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874589402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:52,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-03-09 00:27:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761895544] [2025-03-09 00:27:52,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:52,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:27:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:52,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:27:52,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:27:52,994 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:53,389 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2025-03-09 00:27:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:53,389 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2025-03-09 00:27:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:53,390 INFO L225 Difference]: With dead ends: 230 [2025-03-09 00:27:53,390 INFO L226 Difference]: Without dead ends: 230 [2025-03-09 00:27:53,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2025-03-09 00:27:53,391 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 146 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:53,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 307 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:27:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-09 00:27:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 111. [2025-03-09 00:27:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2025-03-09 00:27:53,394 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 108 [2025-03-09 00:27:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:53,395 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2025-03-09 00:27:53,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2025-03-09 00:27:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 00:27:53,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:53,396 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 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-03-09 00:27:53,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:27:53,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 00:27:53,596 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:27:53,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -970013940, now seen corresponding path program 1 times [2025-03-09 00:27:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311877714] [2025-03-09 00:27:53,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:53,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 00:27:53,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 00:27:53,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:53,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:27:53,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:27:53,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 00:27:53,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 00:27:53,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:53,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:27:53,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:27:53,908 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:27:53,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE (37 of 38 remaining) [2025-03-09 00:27:53,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (36 of 38 remaining) [2025-03-09 00:27:53,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (35 of 38 remaining) [2025-03-09 00:27:53,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (34 of 38 remaining) [2025-03-09 00:27:53,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (33 of 38 remaining) [2025-03-09 00:27:53,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (32 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (31 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (30 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (29 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (28 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (27 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (26 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (25 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (24 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2025-03-09 00:27:53,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2025-03-09 00:27:53,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2025-03-09 00:27:53,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2025-03-09 00:27:53,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2025-03-09 00:27:53,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2025-03-09 00:27:53,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 38 remaining) [2025-03-09 00:27:53,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 38 remaining) [2025-03-09 00:27:53,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 00:27:53,917 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:54,070 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:27:54,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:27:54 BoogieIcfgContainer [2025-03-09 00:27:54,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:27:54,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:27:54,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:27:54,083 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:27:54,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:27:29" (3/4) ... [2025-03-09 00:27:54,086 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:27:54,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:27:54,092 INFO L158 Benchmark]: Toolchain (without parser) took 26010.24ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 109.7MB in the beginning and 66.5MB in the end (delta: 43.2MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2025-03-09 00:27:54,092 INFO L158 Benchmark]: CDTParser took 1.32ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:27:54,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 940.10ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 45.3MB in the end (delta: 64.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 00:27:54,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.25ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 106.3MB in the end (delta: -61.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2025-03-09 00:27:54,092 INFO L158 Benchmark]: Boogie Preprocessor took 99.11ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 100.2MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:27:54,092 INFO L158 Benchmark]: IcfgBuilder took 652.80ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 51.0MB in the end (delta: 49.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 00:27:54,092 INFO L158 Benchmark]: TraceAbstraction took 24230.84ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 50.4MB in the beginning and 66.6MB in the end (delta: -16.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2025-03-09 00:27:54,093 INFO L158 Benchmark]: Witness Printer took 10.05ms. Allocated memory is still 167.8MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:27:54,093 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 940.10ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 45.3MB in the end (delta: 64.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.25ms. Allocated memory is still 142.6MB. Free memory was 45.3MB in the beginning and 106.3MB in the end (delta: -61.0MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.11ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 100.2MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 652.80ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 51.0MB in the end (delta: 49.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24230.84ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 50.4MB in the beginning and 66.6MB in the end (delta: -16.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Witness Printer took 10.05ms. Allocated memory is still 167.8MB. Free memory was 66.6MB in the beginning and 66.5MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1774]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1774. Possible FailurePath: [L1763] static const char *applet_name; [L1764] static signed int bb_errno_location; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1858] char *a = malloc(11); [L1859] a[10] = 0 VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=1] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=2] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=3] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=4] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=5] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=6] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=7] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=8] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=9] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=10] [L1860] COND FALSE !(i<10) [L1862] applet_name = a [L1863] bb_errno_location = __VERIFIER_nondet_int() [L1864] optind = 1 [L1865] int argc = __VERIFIER_nondet_int(); [L1866] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1866] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [a={-1:0}, applet_name={-1:0}, argc=1, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1867] char **argv=malloc((argc+1)*sizeof(char*)); [L1868] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1869] argv[argc]=0 VAL [applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1870] int i=0; VAL [a={-1:0}, applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0, mem_track={-12:0}, optind=1] [L1870] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2025-03-09 00:27:56,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:27:56,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:27:56,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:27:56,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:27:56,613 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:27:56,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 00:27:57,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4c144e/69a0c5697710400fa03989e33436af33/FLAGbd76d05c9 [2025-03-09 00:27:58,158 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:27:58,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 00:27:58,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4c144e/69a0c5697710400fa03989e33436af33/FLAGbd76d05c9 [2025-03-09 00:27:58,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1b4c144e/69a0c5697710400fa03989e33436af33 [2025-03-09 00:27:58,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:27:58,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:27:58,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:27:58,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:27:58,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:27:58,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:58,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69298cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58, skipping insertion in model container [2025-03-09 00:27:58,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:58,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:27:58,693 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:27:58,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:27:58,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:27:58,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:27:58,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:27:58,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:27:58,939 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:27:58,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58 WrapperNode [2025-03-09 00:27:58,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:27:58,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:27:58,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:27:58,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:27:58,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:58,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,017 INFO L138 Inliner]: procedures = 531, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 479 [2025-03-09 00:27:59,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:27:59,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:27:59,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:27:59,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:27:59,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,071 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 2, 355, 6, 2, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 0, 355, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 2, 1, 2]. [2025-03-09 00:27:59,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:27:59,122 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:27:59,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:27:59,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:27:59,123 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (1/1) ... [2025-03-09 00:27:59,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:27:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:59,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:27:59,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:27:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:27:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-09 00:27:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-09 00:27:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-09 00:27:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-09 00:27:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-09 00:27:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-09 00:27:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:27:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-09 00:27:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-09 00:27:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-09 00:27:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:27:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:27:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:27:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:27:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:27:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 00:27:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 00:27:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 00:27:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:27:59,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:27:59,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-09 00:27:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-09 00:27:59,505 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:27:59,507 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:28:00,097 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1793: havoc gethostid_#t~nondet74#1; [2025-03-09 00:28:00,112 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-03-09 00:28:00,113 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:28:00,119 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:28:00,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:28:00,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:00 BoogieIcfgContainer [2025-03-09 00:28:00,120 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:28:00,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:28:00,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:28:00,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:28:00,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:27:58" (1/3) ... [2025-03-09 00:28:00,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653660ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:00, skipping insertion in model container [2025-03-09 00:28:00,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:27:58" (2/3) ... [2025-03-09 00:28:00,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653660ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:00, skipping insertion in model container [2025-03-09 00:28:00,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:00" (3/3) ... [2025-03-09 00:28:00,130 INFO L128 eAbstractionObserver]: Analyzing ICFG hostid.i [2025-03-09 00:28:00,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:28:00,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hostid.i that has 2 procedures, 92 locations, 1 initial locations, 5 loop locations, and 38 error locations. [2025-03-09 00:28:00,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:28:00,179 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;@d0149bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:28:00,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-09 00:28:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 89 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:00,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:00,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:00,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash 129057, now seen corresponding path program 1 times [2025-03-09 00:28:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:00,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984885103] [2025-03-09 00:28:00,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:00,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:00,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:00,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:00,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:28:00,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:00,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:00,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:00,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:00,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:28:00,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:00,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-09 00:28:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:00,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:00,872 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:00,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984885103] [2025-03-09 00:28:00,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984885103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:00,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:00,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:00,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427414878] [2025-03-09 00:28:00,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:00,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:00,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:00,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:00,895 INFO L87 Difference]: Start difference. First operand has 92 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 89 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:28:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:01,063 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2025-03-09 00:28:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:01,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-09 00:28:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:01,069 INFO L225 Difference]: With dead ends: 56 [2025-03-09 00:28:01,069 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 00:28:01,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:01,075 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 48 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:01,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 37 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:28:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 00:28:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-09 00:28:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 53 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-03-09 00:28:01,102 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 3 [2025-03-09 00:28:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:01,102 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-03-09 00:28:01,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:28:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-03-09 00:28:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:01,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:01,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:01,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:28:01,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:01,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:01,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 129058, now seen corresponding path program 1 times [2025-03-09 00:28:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:01,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081565921] [2025-03-09 00:28:01,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:01,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:01,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:01,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:28:01,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:01,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:01,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:01,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:01,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:28:01,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:01,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:01,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:01,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081565921] [2025-03-09 00:28:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081565921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862479872] [2025-03-09 00:28:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:01,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:01,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:01,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:01,912 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:28:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:02,123 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-03-09 00:28:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:02,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-09 00:28:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:02,125 INFO L225 Difference]: With dead ends: 55 [2025-03-09 00:28:02,125 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 00:28:02,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:02,125 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:02,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:28:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 00:28:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 00:28:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.696969696969697) internal successors, (56), 52 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-03-09 00:28:02,129 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 3 [2025-03-09 00:28:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:02,129 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-03-09 00:28:02,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03-09 00:28:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-03-09 00:28:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:28:02,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:02,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:28:02,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:28:02,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:02,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:02,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash -450165698, now seen corresponding path program 1 times [2025-03-09 00:28:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321854278] [2025-03-09 00:28:02,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:02,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:02,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:02,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:02,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:28:02,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:28:02,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:28:02,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:02,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:02,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:28:02,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:02,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:02,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:02,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321854278] [2025-03-09 00:28:02,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321854278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:02,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:28:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676208553] [2025-03-09 00:28:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:02,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:28:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:02,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:28:02,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:02,923 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-09 00:28:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:03,220 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-09 00:28:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:28:03,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-09 00:28:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:03,222 INFO L225 Difference]: With dead ends: 58 [2025-03-09 00:28:03,222 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 00:28:03,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:03,223 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:03,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:28:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 00:28:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-09 00:28:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 54 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-09 00:28:03,229 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 6 [2025-03-09 00:28:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:03,229 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-09 00:28:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-03-09 00:28:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-09 00:28:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:28:03,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:03,230 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:03,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:28:03,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:03,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1998381091, now seen corresponding path program 1 times [2025-03-09 00:28:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957457509] [2025-03-09 00:28:03,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:03,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:03,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:03,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:03,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:28:03,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:03,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:03,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:03,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:04,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:28:04,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:04,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:04,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:04,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:04,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957457509] [2025-03-09 00:28:04,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957457509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:04,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:28:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 00:28:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79007095] [2025-03-09 00:28:04,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:04,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:28:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:04,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:28:04,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:28:04,360 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-03-09 00:28:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:05,148 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-09 00:28:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:28:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:28:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:05,151 INFO L225 Difference]: With dead ends: 61 [2025-03-09 00:28:05,151 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 00:28:05,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:28:05,151 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:05,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 00:28:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 00:28:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-09 00:28:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.55) internal successors, (62), 58 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-09 00:28:05,156 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 9 [2025-03-09 00:28:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:05,157 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-09 00:28:05,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-03-09 00:28:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-09 00:28:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 00:28:05,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:05,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:05,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:28:05,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:05,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:05,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1084613940, now seen corresponding path program 1 times [2025-03-09 00:28:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:05,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938907997] [2025-03-09 00:28:05,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:05,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:05,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:28:05,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:28:05,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:28:05,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:05,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:06,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:28:06,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:06,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:06,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:06,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:06,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938907997] [2025-03-09 00:28:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938907997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:06,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:28:06,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-09 00:28:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884730114] [2025-03-09 00:28:06,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:06,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:28:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:06,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:28:06,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:28:06,530 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:28:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:07,446 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-03-09 00:28:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:28:07,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 00:28:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:07,447 INFO L225 Difference]: With dead ends: 76 [2025-03-09 00:28:07,447 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 00:28:07,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:28:07,448 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:07,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 289 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 00:28:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 00:28:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 00:28:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.4) internal successors, (77), 73 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-09 00:28:07,452 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 21 [2025-03-09 00:28:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:07,452 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-09 00:28:07,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:28:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-09 00:28:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:28:07,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:07,453 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:07,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 00:28:07,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:07,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:07,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 658158733, now seen corresponding path program 2 times [2025-03-09 00:28:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:07,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075031676] [2025-03-09 00:28:07,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:28:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:07,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:07,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:28:07,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:28:08,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-03-09 00:28:08,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:28:08,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:08,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:28:08,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:08,296 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2025-03-09 00:28:08,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-03-09 00:28:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-09 00:28:08,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:08,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075031676] [2025-03-09 00:28:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075031676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:08,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450998899] [2025-03-09 00:28:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:08,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:08,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:08,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:08,307 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:08,476 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2025-03-09 00:28:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:08,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-09 00:28:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:08,477 INFO L225 Difference]: With dead ends: 71 [2025-03-09 00:28:08,477 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 00:28:08,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-03-09 00:28:08,477 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:08,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:28:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 00:28:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 00:28:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.309090909090909) internal successors, (72), 68 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2025-03-09 00:28:08,483 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 36 [2025-03-09 00:28:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:08,484 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2025-03-09 00:28:08,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2025-03-09 00:28:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:28:08,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:08,485 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:08,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:28:08,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:08,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:08,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash 658158734, now seen corresponding path program 1 times [2025-03-09 00:28:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321342470] [2025-03-09 00:28:08,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:08,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:08,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:08,690 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:08,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:28:08,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 00:28:09,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:28:09,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:09,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:09,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 00:28:09,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:09,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:09,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:12,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321342470] [2025-03-09 00:28:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321342470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:12,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:28:12,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-09 00:28:12,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709425063] [2025-03-09 00:28:12,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:12,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:28:12,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:12,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:28:12,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-03-09 00:28:12,040 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:28:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:15,287 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2025-03-09 00:28:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 00:28:15,288 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-09 00:28:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:15,288 INFO L225 Difference]: With dead ends: 101 [2025-03-09 00:28:15,288 INFO L226 Difference]: Without dead ends: 101 [2025-03-09 00:28:15,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 00:28:15,289 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 63 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:15,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 376 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 00:28:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-09 00:28:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-09 00:28:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 98 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2025-03-09 00:28:15,293 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 36 [2025-03-09 00:28:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:15,293 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2025-03-09 00:28:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 00:28:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2025-03-09 00:28:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 00:28:15,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:15,294 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:15,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:28:15,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:15,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:15,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 106431534, now seen corresponding path program 2 times [2025-03-09 00:28:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584170725] [2025-03-09 00:28:15,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:28:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:15,498 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:15,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:28:15,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 00:28:16,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-09 00:28:16,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:28:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:16,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 00:28:16,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:16,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:16,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2025-03-09 00:28:16,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-09 00:28:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:16,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:16,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584170725] [2025-03-09 00:28:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584170725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:16,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:16,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:28:16,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355559887] [2025-03-09 00:28:16,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:16,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:28:16,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:16,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:28:16,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:28:16,261 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:16,520 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2025-03-09 00:28:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:28:16,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-03-09 00:28:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:16,522 INFO L225 Difference]: With dead ends: 110 [2025-03-09 00:28:16,522 INFO L226 Difference]: Without dead ends: 110 [2025-03-09 00:28:16,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:28:16,522 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:16,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 156 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:28:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-09 00:28:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2025-03-09 00:28:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.2) internal successors, (102), 97 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2025-03-09 00:28:16,529 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 42 [2025-03-09 00:28:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:16,530 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2025-03-09 00:28:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2025-03-09 00:28:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 00:28:16,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:16,530 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:16,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:28:16,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:16,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:16,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1015987750, now seen corresponding path program 1 times [2025-03-09 00:28:16,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:16,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298031936] [2025-03-09 00:28:16,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:16,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:16,735 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:16,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:28:16,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 00:28:17,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 00:28:17,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:17,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:17,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:28:17,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:17,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:17,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 00:28:17,609 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:28:17,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 00:28:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:17,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:17,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:17,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298031936] [2025-03-09 00:28:17,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298031936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:17,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:17,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 00:28:17,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729430103] [2025-03-09 00:28:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:17,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 00:28:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:17,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 00:28:17,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:28:17,750 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:18,846 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2025-03-09 00:28:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:28:18,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-03-09 00:28:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:18,848 INFO L225 Difference]: With dead ends: 119 [2025-03-09 00:28:18,848 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 00:28:18,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 00:28:18,848 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 54 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:18,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 119 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:28:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 00:28:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2025-03-09 00:28:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 111 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2025-03-09 00:28:18,854 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 45 [2025-03-09 00:28:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:18,855 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2025-03-09 00:28:18,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2025-03-09 00:28:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:28:18,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:18,855 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:18,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:28:19,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:19,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:19,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash 656543112, now seen corresponding path program 1 times [2025-03-09 00:28:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:19,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925788660] [2025-03-09 00:28:19,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:19,059 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:19,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:28:19,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:28:19,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:28:19,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:19,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:19,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:28:19,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:19,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-09 00:28:19,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:19,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2025-03-09 00:28:19,782 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-09 00:28:19,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2025-03-09 00:28:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:19,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:19,802 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925788660] [2025-03-09 00:28:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925788660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:19,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:19,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571190754] [2025-03-09 00:28:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:19,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:19,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:19,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:19,803 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:19,945 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2025-03-09 00:28:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:19,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-09 00:28:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:19,946 INFO L225 Difference]: With dead ends: 113 [2025-03-09 00:28:19,946 INFO L226 Difference]: Without dead ends: 113 [2025-03-09 00:28:19,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:19,947 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:19,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:28:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-09 00:28:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-09 00:28:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2025-03-09 00:28:19,954 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 48 [2025-03-09 00:28:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:19,954 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2025-03-09 00:28:19,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2025-03-09 00:28:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:28:19,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:19,955 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:19,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:28:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:20,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:20,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash 656543113, now seen corresponding path program 1 times [2025-03-09 00:28:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:20,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892944858] [2025-03-09 00:28:20,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:20,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:20,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:20,159 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:20,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:28:20,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:28:20,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:28:20,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:20,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:20,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 00:28:20,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:20,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2025-03-09 00:28:20,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 00:28:20,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2025-03-09 00:28:20,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:20,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2025-03-09 00:28:21,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:21,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 00:28:21,095 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:28:21,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 00:28:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:21,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:21,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892944858] [2025-03-09 00:28:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892944858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:28:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102768331] [2025-03-09 00:28:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:21,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:28:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:21,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:28:21,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:28:21,209 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:21,829 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2025-03-09 00:28:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:28:21,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-09 00:28:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:21,830 INFO L225 Difference]: With dead ends: 117 [2025-03-09 00:28:21,830 INFO L226 Difference]: Without dead ends: 117 [2025-03-09 00:28:21,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:28:21,831 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:21,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 101 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 00:28:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-09 00:28:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2025-03-09 00:28:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.2121212121212122) internal successors, (120), 110 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2025-03-09 00:28:21,834 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 48 [2025-03-09 00:28:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:21,834 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2025-03-09 00:28:21,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2025-03-09 00:28:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:28:21,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:21,835 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:21,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 00:28:22,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:22,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:22,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -205175778, now seen corresponding path program 1 times [2025-03-09 00:28:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239811198] [2025-03-09 00:28:22,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:22,038 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:22,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:28:22,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:28:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:28:22,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:22,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:22,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:28:22,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:22,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-09 00:28:22,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-03-09 00:28:22,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-03-09 00:28:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:22,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:22,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:22,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239811198] [2025-03-09 00:28:22,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239811198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:22,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:22,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:28:22,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916594255] [2025-03-09 00:28:22,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:22,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:28:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:22,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:28:22,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:28:22,735 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:23,156 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2025-03-09 00:28:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:28:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 00:28:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:23,158 INFO L225 Difference]: With dead ends: 112 [2025-03-09 00:28:23,158 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 00:28:23,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:28:23,159 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:23,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:28:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 00:28:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-09 00:28:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 109 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-03-09 00:28:23,164 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 51 [2025-03-09 00:28:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:23,164 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-03-09 00:28:23,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-03-09 00:28:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 00:28:23,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:23,166 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:23,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 00:28:23,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:23,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:23,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash -205175777, now seen corresponding path program 1 times [2025-03-09 00:28:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:23,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815610451] [2025-03-09 00:28:23,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:23,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:23,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:23,370 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:23,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:28:23,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 00:28:23,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 00:28:23,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:23,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:23,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:28:23,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:23,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:24,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-03-09 00:28:24,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-09 00:28:24,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2025-03-09 00:28:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:24,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:24,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815610451] [2025-03-09 00:28:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815610451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:24,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:28:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525728412] [2025-03-09 00:28:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:24,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:28:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:24,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:28:24,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:28:24,132 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:24,608 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2025-03-09 00:28:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:28:24,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 00:28:24,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:24,610 INFO L225 Difference]: With dead ends: 111 [2025-03-09 00:28:24,610 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 00:28:24,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:28:24,611 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:24,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:28:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 00:28:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-09 00:28:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 108 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2025-03-09 00:28:24,615 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 51 [2025-03-09 00:28:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:24,615 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2025-03-09 00:28:24,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2025-03-09 00:28:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 00:28:24,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:24,616 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:24,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 00:28:24,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:24,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:24,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1228528210, now seen corresponding path program 1 times [2025-03-09 00:28:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453005631] [2025-03-09 00:28:24,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:24,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:24,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:24,819 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:24,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 00:28:24,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 00:28:25,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 00:28:25,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:25,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:25,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:28:25,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:25,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:25,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453005631] [2025-03-09 00:28:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453005631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:25,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:28:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367998791] [2025-03-09 00:28:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:25,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:25,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:25,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:25,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:25,488 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:25,534 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2025-03-09 00:28:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:25,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 00:28:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:25,537 INFO L225 Difference]: With dead ends: 123 [2025-03-09 00:28:25,537 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 00:28:25,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-03-09 00:28:25,538 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:25,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:28:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 00:28:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2025-03-09 00:28:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 110 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2025-03-09 00:28:25,542 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 55 [2025-03-09 00:28:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:25,542 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2025-03-09 00:28:25,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2025-03-09 00:28:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:28:25,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:25,544 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 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-03-09 00:28:25,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 00:28:25,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:25,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:25,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash -570084802, now seen corresponding path program 1 times [2025-03-09 00:28:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454299912] [2025-03-09 00:28:25,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:25,748 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:25,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 00:28:25,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:28:26,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:28:26,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:26,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:26,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:28:26,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:26,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-03-09 00:28:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:26,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:26,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454299912] [2025-03-09 00:28:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454299912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:28:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302879293] [2025-03-09 00:28:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:26,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:28:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:26,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:28:26,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:28:26,482 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:26,877 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2025-03-09 00:28:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:28:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 00:28:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:26,879 INFO L225 Difference]: With dead ends: 112 [2025-03-09 00:28:26,879 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 00:28:26,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:28:26,879 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:26,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:28:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 00:28:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-09 00:28:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.1485148514851484) internal successors, (116), 109 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2025-03-09 00:28:26,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 56 [2025-03-09 00:28:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:26,884 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2025-03-09 00:28:26,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2025-03-09 00:28:26,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 00:28:26,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:26,885 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 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-03-09 00:28:26,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 00:28:27,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:27,085 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:27,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash -570084801, now seen corresponding path program 1 times [2025-03-09 00:28:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:27,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942623728] [2025-03-09 00:28:27,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:27,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:27,088 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:27,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 00:28:27,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 00:28:27,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 00:28:27,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:27,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:27,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:28:27,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:27,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:27,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-03-09 00:28:27,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-09 00:28:27,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2025-03-09 00:28:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:28,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:28:28,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:28,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942623728] [2025-03-09 00:28:28,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942623728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:28,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:28:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946466020] [2025-03-09 00:28:28,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:28,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:28:28,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:28,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:28:28,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:28:28,009 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:28,522 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2025-03-09 00:28:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:28:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-09 00:28:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:28,524 INFO L225 Difference]: With dead ends: 120 [2025-03-09 00:28:28,524 INFO L226 Difference]: Without dead ends: 120 [2025-03-09 00:28:28,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:28:28,524 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:28,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 92 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 00:28:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-09 00:28:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2025-03-09 00:28:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 115 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2025-03-09 00:28:28,527 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 56 [2025-03-09 00:28:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:28,527 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2025-03-09 00:28:28,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2025-03-09 00:28:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 00:28:28,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:28,528 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-09 00:28:28,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 00:28:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:28,729 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:28,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash 395419931, now seen corresponding path program 1 times [2025-03-09 00:28:28,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:28,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608603769] [2025-03-09 00:28:28,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:28,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:28,732 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:28,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 00:28:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 00:28:29,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 00:28:29,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:29,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:29,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:28:29,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:29,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:29,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608603769] [2025-03-09 00:28:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608603769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:29,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:28:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-09 00:28:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184168505] [2025-03-09 00:28:29,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:29,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:28:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:29,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:28:29,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:28:29,510 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:29,576 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2025-03-09 00:28:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:28:29,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-03-09 00:28:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:29,577 INFO L225 Difference]: With dead ends: 145 [2025-03-09 00:28:29,577 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 00:28:29,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:28:29,578 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:29,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 129 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:28:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 00:28:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2025-03-09 00:28:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.16793893129771) internal successors, (153), 139 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2025-03-09 00:28:29,582 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 60 [2025-03-09 00:28:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:29,582 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2025-03-09 00:28:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2025-03-09 00:28:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 00:28:29,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:29,583 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:29,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 00:28:29,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:29,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:29,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -626637674, now seen corresponding path program 1 times [2025-03-09 00:28:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:29,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628298491] [2025-03-09 00:28:29,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:29,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:29,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:29,787 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:29,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 00:28:29,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:28:30,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:28:30,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:30,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:30,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 00:28:30,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:30,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:30,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-03-09 00:28:30,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-09 00:28:30,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2025-03-09 00:28:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:30,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:31,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628298491] [2025-03-09 00:28:31,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628298491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:31,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:28:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 00:28:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014345221] [2025-03-09 00:28:31,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:31,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:28:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:31,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:28:31,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:28:31,685 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:33,313 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2025-03-09 00:28:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 00:28:33,314 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-03-09 00:28:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:33,315 INFO L225 Difference]: With dead ends: 141 [2025-03-09 00:28:33,315 INFO L226 Difference]: Without dead ends: 141 [2025-03-09 00:28:33,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:28:33,316 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:33,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 151 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 00:28:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-09 00:28:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-09 00:28:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 131 states have (on average 1.1221374045801527) internal successors, (147), 138 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2025-03-09 00:28:33,320 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 61 [2025-03-09 00:28:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:33,320 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2025-03-09 00:28:33,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2025-03-09 00:28:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 00:28:33,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:33,322 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:33,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 00:28:33,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:33,523 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2071395730, now seen corresponding path program 2 times [2025-03-09 00:28:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:33,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41841568] [2025-03-09 00:28:33,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:28:33,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:33,526 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:33,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 00:28:33,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 00:28:34,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 00:28:34,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:28:34,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:34,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 00:28:34,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:34,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:28:34,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-09 00:28:34,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-03-09 00:28:34,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2025-03-09 00:28:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:35,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:28:36,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:28:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41841568] [2025-03-09 00:28:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41841568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:36,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:28:36,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-03-09 00:28:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878171256] [2025-03-09 00:28:36,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:36,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:28:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:28:36,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:28:36,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:28:36,774 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:39,401 INFO L93 Difference]: Finished difference Result 207 states and 215 transitions. [2025-03-09 00:28:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 00:28:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-03-09 00:28:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:39,404 INFO L225 Difference]: With dead ends: 207 [2025-03-09 00:28:39,404 INFO L226 Difference]: Without dead ends: 207 [2025-03-09 00:28:39,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=295, Invalid=575, Unknown=0, NotChecked=0, Total=870 [2025-03-09 00:28:39,405 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 102 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:39,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 250 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 00:28:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-09 00:28:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2025-03-09 00:28:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 191 states have (on average 1.1151832460732984) internal successors, (213), 198 states have internal predecessors, (213), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 215 transitions. [2025-03-09 00:28:39,410 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 215 transitions. Word has length 75 [2025-03-09 00:28:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:39,410 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 215 transitions. [2025-03-09 00:28:39,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 215 transitions. [2025-03-09 00:28:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 00:28:39,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:39,411 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:39,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 00:28:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:39,611 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-03-09 00:28:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash 483243634, now seen corresponding path program 3 times [2025-03-09 00:28:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:28:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429457295] [2025-03-09 00:28:39,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:28:39,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:39,614 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:39,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 00:28:39,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-03-09 00:28:40,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-03-09 00:28:40,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 00:28:40,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:40,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 00:28:40,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:40,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:40,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2025-03-09 00:28:40,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-09 00:28:41,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:41,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 00:28:41,127 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:28:41,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 00:28:42,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:28:42,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 00:28:42,515 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:28:42,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-09 00:28:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-09 00:28:42,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:45,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:28:45,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 82 [2025-03-09 00:28:46,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:28:46,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 76