./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0235-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety/test-0235-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7d3f765c9df15e458548dc8ca5720e088d20a91a9e0ac7b514a0d546a4bcfcf --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:24:56,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:24:57,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:24:57,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:24:57,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:24:57,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:24:57,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:24:57,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:24:57,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:24:57,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:24:57,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:24:57,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:24:57,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:24:57,039 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:24:57,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:57,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:57,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:24:57,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:24:57,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:24:57,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:24:57,041 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e7d3f765c9df15e458548dc8ca5720e088d20a91a9e0ac7b514a0d546a4bcfcf [2025-04-29 11:24:57,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:24:57,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:24:57,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:24:57,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:24:57,301 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:24:57,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235-2.c [2025-04-29 11:24:58,648 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b19e553/4c2fd3dc441041158ecf0eb09d1c4dc9/FLAG1dee692b0 [2025-04-29 11:24:58,883 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:24:58,884 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0235-2.c [2025-04-29 11:24:58,885 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:58,886 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:58,886 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:58,892 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b19e553/4c2fd3dc441041158ecf0eb09d1c4dc9/FLAG1dee692b0 [2025-04-29 11:24:59,699 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b19e553/4c2fd3dc441041158ecf0eb09d1c4dc9 [2025-04-29 11:24:59,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:24:59,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:24:59,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:59,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:24:59,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:24:59,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:24:59,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c17acc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59, skipping insertion in model container [2025-04-29 11:24:59,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:24:59,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:24:59,885 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:59,891 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:24:59,927 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:59,937 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:24:59,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59 WrapperNode [2025-04-29 11:24:59,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:59,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:59,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:24:59,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:24:59,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:24:59,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:24:59,973 INFO L138 Inliner]: procedures = 25, calls = 67, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 228 [2025-04-29 11:24:59,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:59,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:24:59,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:24:59,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:24:59,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:24:59,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:24:59,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,019 INFO L175 MemorySlicer]: Split 35 memory accesses to 2 slices as follows [10, 25]. 71 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 12 writes are split as follows [1, 11]. [2025-04-29 11:25:00,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:25:00,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:25:00,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:25:00,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:25:00,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (1/1) ... [2025-04-29 11:25:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:25:00,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:00,065 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-04-29 11:25:00,072 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-04-29 11:25:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:25:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:25:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-04-29 11:25:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-04-29 11:25:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:25:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:25:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:25:00,165 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:25:00,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:25:00,642 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-04-29 11:25:00,642 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:25:00,655 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:25:00,655 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-04-29 11:25:00,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:00 BoogieIcfgContainer [2025-04-29 11:25:00,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:25:00,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:25:00,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:25:00,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:25:00,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:24:59" (1/3) ... [2025-04-29 11:25:00,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a69784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:00, skipping insertion in model container [2025-04-29 11:25:00,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:59" (2/3) ... [2025-04-29 11:25:00,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a69784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:25:00, skipping insertion in model container [2025-04-29 11:25:00,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:25:00" (3/3) ... [2025-04-29 11:25:00,663 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-2.c [2025-04-29 11:25:00,673 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:25:00,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-2.c that has 3 procedures, 233 locations, 286 edges, 1 initial locations, 11 loop locations, and 87 error locations. [2025-04-29 11:25:00,712 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:25:00,719 INFO L340 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;@7dc096fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:25:00,720 INFO L341 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-04-29 11:25:00,723 INFO L278 IsEmpty]: Start isEmpty. Operand has 233 states, 131 states have (on average 1.9083969465648856) internal successors, (250), 218 states have internal predecessors, (250), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:00,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:25:00,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:00,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:25:00,729 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:00,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 929958, now seen corresponding path program 1 times [2025-04-29 11:25:00,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:00,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779304053] [2025-04-29 11:25:00,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:00,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:25:00,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:25:00,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:00,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:00,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779304053] [2025-04-29 11:25:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779304053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841492408] [2025-04-29 11:25:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:00,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:25:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:00,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:25:00,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:00,858 INFO L87 Difference]: Start difference. First operand has 233 states, 131 states have (on average 1.9083969465648856) internal successors, (250), 218 states have internal predecessors, (250), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:00,887 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2025-04-29 11:25:00,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:25:00,889 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:25:00,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:00,894 INFO L225 Difference]: With dead ends: 233 [2025-04-29 11:25:00,894 INFO L226 Difference]: Without dead ends: 231 [2025-04-29 11:25:00,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:25:00,897 INFO L437 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:00,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:25:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-29 11:25:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-04-29 11:25:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 130 states have (on average 1.823076923076923) internal successors, (237), 216 states have internal predecessors, (237), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 261 transitions. [2025-04-29 11:25:00,936 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 261 transitions. Word has length 4 [2025-04-29 11:25:00,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:00,937 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 261 transitions. [2025-04-29 11:25:00,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:00,937 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 261 transitions. [2025-04-29 11:25:00,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:25:00,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:00,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:25:00,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:25:00,938 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:00,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash 889932981, now seen corresponding path program 1 times [2025-04-29 11:25:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:00,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327542190] [2025-04-29 11:25:00,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:00,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:25:00,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:25:00,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:00,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:01,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:01,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327542190] [2025-04-29 11:25:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327542190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:01,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:01,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:25:01,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636960706] [2025-04-29 11:25:01,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:01,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:25:01,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:01,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:25:01,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:25:01,023 INFO L87 Difference]: Start difference. First operand 231 states and 261 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:01,149 INFO L93 Difference]: Finished difference Result 230 states and 260 transitions. [2025-04-29 11:25:01,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:25:01,149 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:25:01,149 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:01,150 INFO L225 Difference]: With dead ends: 230 [2025-04-29 11:25:01,150 INFO L226 Difference]: Without dead ends: 230 [2025-04-29 11:25:01,151 INFO L436 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-04-29 11:25:01,151 INFO L437 NwaCegarLoop]: 255 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:01,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 427 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-04-29 11:25:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-04-29 11:25:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 130 states have (on average 1.8153846153846154) internal successors, (236), 215 states have internal predecessors, (236), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 260 transitions. [2025-04-29 11:25:01,164 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 260 transitions. Word has length 6 [2025-04-29 11:25:01,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:01,164 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 260 transitions. [2025-04-29 11:25:01,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:01,165 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 260 transitions. [2025-04-29 11:25:01,165 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:25:01,165 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:01,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:25:01,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:25:01,165 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:01,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1818119056, now seen corresponding path program 1 times [2025-04-29 11:25:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:01,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527686652] [2025-04-29 11:25:01,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:01,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:01,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:01,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:01,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:01,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560792627] [2025-04-29 11:25:01,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:01,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:01,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:01,196 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-04-29 11:25:01,198 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-04-29 11:25:01,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:25:01,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:25:01,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:01,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:01,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:25:01,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:01,318 INFO L354 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-04-29 11:25:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:25:01,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:01,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527686652] [2025-04-29 11:25:01,346 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:01,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560792627] [2025-04-29 11:25:01,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560792627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:01,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:01,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866505859] [2025-04-29 11:25:01,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:01,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:01,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:01,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:01,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:01,348 INFO L87 Difference]: Start difference. First operand 230 states and 260 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:01,466 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2025-04-29 11:25:01,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:01,466 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:25:01,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:01,467 INFO L225 Difference]: With dead ends: 239 [2025-04-29 11:25:01,467 INFO L226 Difference]: Without dead ends: 239 [2025-04-29 11:25:01,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04-29 11:25:01,468 INFO L437 NwaCegarLoop]: 250 mSDtfsCounter, 11 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:01,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 679 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-04-29 11:25:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-04-29 11:25:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 138 states have (on average 1.7753623188405796) internal successors, (245), 223 states have internal predecessors, (245), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 269 transitions. [2025-04-29 11:25:01,485 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 269 transitions. Word has length 7 [2025-04-29 11:25:01,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:01,485 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 269 transitions. [2025-04-29 11:25:01,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:25:01,485 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 269 transitions. [2025-04-29 11:25:01,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:25:01,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:01,486 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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-04-29 11:25:01,493 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-04-29 11:25:01,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:01,688 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:01,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash 253014343, now seen corresponding path program 1 times [2025-04-29 11:25:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:01,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851213922] [2025-04-29 11:25:01,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:01,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:25:01,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:25:01,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:01,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:01,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123805867] [2025-04-29 11:25:01,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:01,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:01,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:01,768 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-04-29 11:25:01,770 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-04-29 11:25:01,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:25:01,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:25:01,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:01,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:01,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-29 11:25:01,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:01,963 INFO L354 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 7 [2025-04-29 11:25:01,998 INFO L354 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 13 treesize of output 9 [2025-04-29 11:25:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:25:02,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:02,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851213922] [2025-04-29 11:25:02,065 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:02,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123805867] [2025-04-29 11:25:02,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123805867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:02,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:02,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:25:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507401698] [2025-04-29 11:25:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:02,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:25:02,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:02,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:25:02,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:25:02,067 INFO L87 Difference]: Start difference. First operand 239 states and 269 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:25:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:02,203 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2025-04-29 11:25:02,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:25:02,204 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-04-29 11:25:02,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:02,205 INFO L225 Difference]: With dead ends: 251 [2025-04-29 11:25:02,205 INFO L226 Difference]: Without dead ends: 241 [2025-04-29 11:25:02,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-04-29 11:25:02,206 INFO L437 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:02,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 930 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-29 11:25:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-04-29 11:25:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 140 states have (on average 1.7642857142857142) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 271 transitions. [2025-04-29 11:25:02,217 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 271 transitions. Word has length 66 [2025-04-29 11:25:02,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:02,217 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 271 transitions. [2025-04-29 11:25:02,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:25:02,217 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 271 transitions. [2025-04-29 11:25:02,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 11:25:02,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:02,220 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 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-04-29 11:25:02,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:25:02,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:25:02,421 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:02,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash 851001466, now seen corresponding path program 1 times [2025-04-29 11:25:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:02,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142719511] [2025-04-29 11:25:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:02,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:25:02,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:25:02,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:02,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:02,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501510643] [2025-04-29 11:25:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:02,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:02,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:02,639 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-04-29 11:25:02,643 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-04-29 11:25:02,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:25:02,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:25:02,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:02,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:02,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:25:02,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:02,845 INFO L354 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-04-29 11:25:02,870 INFO L354 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 13 treesize of output 9 [2025-04-29 11:25:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-04-29 11:25:02,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-04-29 11:25:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:03,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142719511] [2025-04-29 11:25:03,097 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:03,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501510643] [2025-04-29 11:25:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501510643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:03,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-04-29 11:25:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419911292] [2025-04-29 11:25:03,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:03,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:25:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:03,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:25:03,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:25:03,098 INFO L87 Difference]: Start difference. First operand 241 states and 271 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:03,374 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2025-04-29 11:25:03,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:25:03,374 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2025-04-29 11:25:03,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:03,375 INFO L225 Difference]: With dead ends: 260 [2025-04-29 11:25:03,375 INFO L226 Difference]: Without dead ends: 245 [2025-04-29 11:25:03,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:25:03,376 INFO L437 NwaCegarLoop]: 254 mSDtfsCounter, 17 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:03,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1191 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-29 11:25:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-04-29 11:25:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 229 states have internal predecessors, (251), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2025-04-29 11:25:03,382 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 71 [2025-04-29 11:25:03,382 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:03,382 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2025-04-29 11:25:03,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:03,383 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2025-04-29 11:25:03,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-29 11:25:03,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:03,384 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 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-04-29 11:25:03,391 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-04-29 11:25:03,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:03,585 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:03,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 678119687, now seen corresponding path program 2 times [2025-04-29 11:25:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:03,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075734682] [2025-04-29 11:25:03,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:03,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:25:03,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:25:03,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:03,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:03,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217010283] [2025-04-29 11:25:03,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:25:03,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:03,739 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-04-29 11:25:03,740 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-04-29 11:25:03,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:25:03,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-29 11:25:03,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:25:03,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:03,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-29 11:25:04,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:04,040 INFO L354 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 7 [2025-04-29 11:25:04,066 INFO L354 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 13 treesize of output 9 [2025-04-29 11:25:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 127 proven. 96 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-04-29 11:25:04,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-04-29 11:25:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:04,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075734682] [2025-04-29 11:25:04,432 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:04,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217010283] [2025-04-29 11:25:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217010283] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:04,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:04,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-04-29 11:25:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109239422] [2025-04-29 11:25:04,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:04,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:25:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:04,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:25:04,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:25:04,433 INFO L87 Difference]: Start difference. First operand 245 states and 275 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:04,929 INFO L93 Difference]: Finished difference Result 267 states and 301 transitions. [2025-04-29 11:25:04,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:25:04,929 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2025-04-29 11:25:04,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:04,930 INFO L225 Difference]: With dead ends: 267 [2025-04-29 11:25:04,930 INFO L226 Difference]: Without dead ends: 252 [2025-04-29 11:25:04,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:25:04,931 INFO L437 NwaCegarLoop]: 254 mSDtfsCounter, 30 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:04,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2688 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:25:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-04-29 11:25:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-04-29 11:25:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 151 states have (on average 1.7086092715231789) internal successors, (258), 236 states have internal predecessors, (258), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2025-04-29 11:25:04,938 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 86 [2025-04-29 11:25:04,938 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:04,938 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2025-04-29 11:25:04,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-04-29 11:25:04,938 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2025-04-29 11:25:04,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-04-29 11:25:04,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:04,940 INFO L218 NwaCegarLoop]: trace histogram [40, 6, 6, 5, 5, 5, 5, 5, 5, 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-04-29 11:25:04,948 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-04-29 11:25:05,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:05,140 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:05,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1486586055, now seen corresponding path program 3 times [2025-04-29 11:25:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:05,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659330608] [2025-04-29 11:25:05,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:25:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:05,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-04-29 11:25:05,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 106 of 106 statements. [2025-04-29 11:25:05,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-04-29 11:25:05,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-29 11:25:05,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24137336] [2025-04-29 11:25:05,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:25:05,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:05,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:05,580 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-04-29 11:25:05,582 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-04-29 11:25:05,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 18 equivalence classes. [2025-04-29 11:25:05,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 106 statements. [2025-04-29 11:25:05,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:25:05,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:05,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:25:05,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:05,723 INFO L354 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-04-29 11:25:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2025-04-29 11:25:05,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:25:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:05,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659330608] [2025-04-29 11:25:05,734 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-29 11:25:05,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24137336] [2025-04-29 11:25:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24137336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:25:05,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:25:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:25:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900390088] [2025-04-29 11:25:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:25:05,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:25:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:05,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:25:05,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:25:05,736 INFO L87 Difference]: Start difference. First operand 252 states and 282 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:05,833 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2025-04-29 11:25:05,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:25:05,833 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 106 [2025-04-29 11:25:05,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:05,835 INFO L225 Difference]: With dead ends: 251 [2025-04-29 11:25:05,835 INFO L226 Difference]: Without dead ends: 251 [2025-04-29 11:25:05,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-04-29 11:25:05,835 INFO L437 NwaCegarLoop]: 262 mSDtfsCounter, 11 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:05,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 701 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:25:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-29 11:25:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-04-29 11:25:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 151 states have (on average 1.7019867549668874) internal successors, (257), 235 states have internal predecessors, (257), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 281 transitions. [2025-04-29 11:25:05,841 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 281 transitions. Word has length 106 [2025-04-29 11:25:05,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:05,842 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 281 transitions. [2025-04-29 11:25:05,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:25:05,842 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 281 transitions. [2025-04-29 11:25:05,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-04-29 11:25:05,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:05,843 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 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-04-29 11:25:05,849 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-04-29 11:25:06,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:06,047 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:06,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2117878513, now seen corresponding path program 1 times [2025-04-29 11:25:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:06,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114114208] [2025-04-29 11:25:06,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:06,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:06,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:06,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:06,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:06,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 658 proven. 4 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-04-29 11:25:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:06,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114114208] [2025-04-29 11:25:06,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114114208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:06,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528412844] [2025-04-29 11:25:06,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:06,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:06,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:06,868 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-04-29 11:25:06,870 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-04-29 11:25:06,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:07,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:07,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:07,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:07,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:25:07,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:07,148 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:25:07,183 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:07,183 INFO L354 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 12 treesize of output 14 [2025-04-29 11:25:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 1 refuted. 0 times theorem prover too weak. 733 trivial. 60 not checked. [2025-04-29 11:25:07,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:07,413 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:25:07,413 INFO L354 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 12 treesize of output 11 [2025-04-29 11:25:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 61 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-04-29 11:25:07,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528412844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:07,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:07,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-04-29 11:25:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502487184] [2025-04-29 11:25:07,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:07,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:25:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:07,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:25:07,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-04-29 11:25:07,431 INFO L87 Difference]: Start difference. First operand 251 states and 281 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-29 11:25:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:07,978 INFO L93 Difference]: Finished difference Result 350 states and 400 transitions. [2025-04-29 11:25:07,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:25:07,978 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2025-04-29 11:25:07,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:07,980 INFO L225 Difference]: With dead ends: 350 [2025-04-29 11:25:07,980 INFO L226 Difference]: Without dead ends: 350 [2025-04-29 11:25:07,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2025-04-29 11:25:07,981 INFO L437 NwaCegarLoop]: 208 mSDtfsCounter, 347 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:07,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1760 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 984 Invalid, 0 Unknown, 370 Unchecked, 0.5s Time] [2025-04-29 11:25:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-04-29 11:25:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 249. [2025-04-29 11:25:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 151 states have (on average 1.6887417218543046) internal successors, (255), 233 states have internal predecessors, (255), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 279 transitions. [2025-04-29 11:25:07,988 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 279 transitions. Word has length 118 [2025-04-29 11:25:07,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:07,989 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 279 transitions. [2025-04-29 11:25:07,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-29 11:25:07,989 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 279 transitions. [2025-04-29 11:25:07,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-04-29 11:25:07,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:07,990 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 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-04-29 11:25:07,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:25:08,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:08,190 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:08,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2117878512, now seen corresponding path program 1 times [2025-04-29 11:25:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:08,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37973289] [2025-04-29 11:25:08,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:08,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:08,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:08,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:08,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 601 proven. 97 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-04-29 11:25:09,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:09,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37973289] [2025-04-29 11:25:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37973289] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:09,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887968732] [2025-04-29 11:25:09,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:09,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:09,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:09,848 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-04-29 11:25:09,850 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-04-29 11:25:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:25:10,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:25:10,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:10,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:10,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-04-29 11:25:10,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:10,474 INFO L354 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 10 treesize of output 9 [2025-04-29 11:25:20,452 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-04-29 11:25:20,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:25:20,518 INFO L354 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 18 treesize of output 13 [2025-04-29 11:25:20,529 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:25:20,530 INFO L354 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-04-29 11:25:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 419 proven. 526 refuted. 0 times theorem prover too weak. 305 trivial. 145 not checked. [2025-04-29 11:25:20,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:20,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887968732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:20,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:25:20,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2025-04-29 11:25:20,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743659789] [2025-04-29 11:25:20,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:20,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 11:25:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:20,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 11:25:20,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2012, Unknown=3, NotChecked=90, Total=2256 [2025-04-29 11:25:20,747 INFO L87 Difference]: Start difference. First operand 249 states and 279 transitions. Second operand has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-29 11:25:24,782 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-04-29 11:25:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:28,923 INFO L93 Difference]: Finished difference Result 356 states and 409 transitions. [2025-04-29 11:25:28,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:25:28,923 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 118 [2025-04-29 11:25:28,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:28,925 INFO L225 Difference]: With dead ends: 356 [2025-04-29 11:25:28,925 INFO L226 Difference]: Without dead ends: 356 [2025-04-29 11:25:28,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=296, Invalid=3487, Unknown=3, NotChecked=120, Total=3906 [2025-04-29 11:25:28,926 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 264 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 4904 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 5288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4904 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:28,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1865 Invalid, 5288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4904 Invalid, 1 Unknown, 368 Unchecked, 7.0s Time] [2025-04-29 11:25:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-29 11:25:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 247. [2025-04-29 11:25:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 231 states have internal predecessors, (253), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-04-29 11:25:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 277 transitions. [2025-04-29 11:25:28,934 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 277 transitions. Word has length 118 [2025-04-29 11:25:28,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:28,935 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 277 transitions. [2025-04-29 11:25:28,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 41 states have internal predecessors, (82), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-29 11:25:28,935 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 277 transitions. [2025-04-29 11:25:28,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-04-29 11:25:28,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:28,936 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 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-04-29 11:25:28,951 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-04-29 11:25:29,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:29,138 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:29,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash 533247536, now seen corresponding path program 1 times [2025-04-29 11:25:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:29,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704209765] [2025-04-29 11:25:29,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:29,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:29,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:29,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:29,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 776 proven. 153 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-04-29 11:25:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:30,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704209765] [2025-04-29 11:25:30,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704209765] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:30,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080872184] [2025-04-29 11:25:30,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:30,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:30,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:30,026 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-04-29 11:25:30,028 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-04-29 11:25:30,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:30,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:30,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:30,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:30,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:25:30,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:30,366 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret3#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-04-29 11:25:30,367 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret3#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-04-29 11:25:30,378 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-04-29 11:25:30,380 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-04-29 11:25:30,406 WARN L871 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-04-29 11:25:30,432 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:25:30,433 INFO L354 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 12 treesize of output 14 [2025-04-29 11:25:30,443 WARN L849 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0))))))) is different from false [2025-04-29 11:25:30,445 WARN L871 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0))))))) is different from true [2025-04-29 11:25:30,466 WARN L849 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) is different from false [2025-04-29 11:25:30,468 WARN L871 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select |v_#valid_BEFORE_CALL_9| .cse0)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) is different from true [2025-04-29 11:25:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 90 refuted. 0 times theorem prover too weak. 466 trivial. 120 not checked. [2025-04-29 11:25:30,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:25:31,003 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:25:31,004 INFO L354 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 12 treesize of output 11 [2025-04-29 11:25:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 210 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-04-29 11:25:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080872184] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:25:31,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:25:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 33 [2025-04-29 11:25:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283346314] [2025-04-29 11:25:31,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:25:31,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:25:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:25:31,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:25:31,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=710, Unknown=9, NotChecked=290, Total=1122 [2025-04-29 11:25:31,018 INFO L87 Difference]: Start difference. First operand 247 states and 277 transitions. Second operand has 34 states, 32 states have (on average 2.75) internal successors, (88), 27 states have internal predecessors, (88), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-04-29 11:25:31,232 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret3#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0)) is different from false [2025-04-29 11:25:31,233 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret3#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0)) is different from true [2025-04-29 11:25:31,239 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2025-04-29 11:25:31,241 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2025-04-29 11:25:31,247 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2025-04-29 11:25:31,249 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2025-04-29 11:25:31,251 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) .cse0)) is different from false [2025-04-29 11:25:31,253 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))))) .cse0)) is different from true [2025-04-29 11:25:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:25:32,063 INFO L93 Difference]: Finished difference Result 358 states and 412 transitions. [2025-04-29 11:25:32,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:25:32,063 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.75) internal successors, (88), 27 states have internal predecessors, (88), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 120 [2025-04-29 11:25:32,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:25:32,065 INFO L225 Difference]: With dead ends: 358 [2025-04-29 11:25:32,065 INFO L226 Difference]: Without dead ends: 358 [2025-04-29 11:25:32,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 223 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=961, Unknown=17, NotChecked=648, Total=1806 [2025-04-29 11:25:32,066 INFO L437 NwaCegarLoop]: 212 mSDtfsCounter, 346 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 4119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2126 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:25:32,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 3146 Invalid, 4119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1946 Invalid, 0 Unknown, 2126 Unchecked, 0.9s Time] [2025-04-29 11:25:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-29 11:25:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 257. [2025-04-29 11:25:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 159 states have (on average 1.6540880503144655) internal successors, (263), 239 states have internal predecessors, (263), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-04-29 11:25:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 291 transitions. [2025-04-29 11:25:32,074 INFO L79 Accepts]: Start accepts. Automaton has 257 states and 291 transitions. Word has length 120 [2025-04-29 11:25:32,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:25:32,074 INFO L485 AbstractCegarLoop]: Abstraction has 257 states and 291 transitions. [2025-04-29 11:25:32,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.75) internal successors, (88), 27 states have internal predecessors, (88), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-04-29 11:25:32,075 INFO L278 IsEmpty]: Start isEmpty. Operand 257 states and 291 transitions. [2025-04-29 11:25:32,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-04-29 11:25:32,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:25:32,076 INFO L218 NwaCegarLoop]: trace histogram [45, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 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-04-29 11:25:32,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:25:32,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:25:32,277 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2025-04-29 11:25:32,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:25:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 533247537, now seen corresponding path program 1 times [2025-04-29 11:25:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:25:32,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288563825] [2025-04-29 11:25:32,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:25:32,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:32,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:32,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:32,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 719 proven. 246 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-04-29 11:25:34,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:25:34,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288563825] [2025-04-29 11:25:34,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288563825] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:25:34,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687676800] [2025-04-29 11:25:34,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:25:34,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:25:34,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:25:34,052 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-04-29 11:25:34,054 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-04-29 11:25:34,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-29 11:25:34,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:25:34,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:25:34,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:25:34,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-04-29 11:25:34,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:25:34,650 INFO L354 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 Killed by 15