./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0235-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0235-2.i -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 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:37:54,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:37:54,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:37:54,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:37:54,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:37:54,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:37:54,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:37:54,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:37:54,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:37:54,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:37:54,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:37:54,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:37:54,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:37:54,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:37:54,526 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:37:54,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:37:54,526 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:37:54,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:37:54,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:37:54,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:37:54,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:37:54,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:37:54,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:37:54,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:37:54,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:37:54,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:37:54,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:37:54,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:37:54,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:37:54,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:37:54,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:37:54,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:37:54,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:37:54,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:37:54,529 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 -> 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 [2025-03-04 07:37:54,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:37:54,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:37:54,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:37:54,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:37:54,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:37:54,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0235-2.i [2025-03-04 07:37:55,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2057d4ba/2e5c830853c34940b8941e1112d79ba9/FLAGfbb7b866a [2025-03-04 07:37:56,211 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:37:56,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0235-2.i [2025-03-04 07:37:56,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2057d4ba/2e5c830853c34940b8941e1112d79ba9/FLAGfbb7b866a [2025-03-04 07:37:56,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2057d4ba/2e5c830853c34940b8941e1112d79ba9 [2025-03-04 07:37:56,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:37:56,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:37:56,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:37:56,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:37:56,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:37:56,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d847d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56, skipping insertion in model container [2025-03-04 07:37:56,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:37:56,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:37:56,758 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:37:56,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:37:56,827 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:37:56,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56 WrapperNode [2025-03-04 07:37:56,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:37:56,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:37:56,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:37:56,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:37:56,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,872 INFO L138 Inliner]: procedures = 188, calls = 71, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 233 [2025-03-04 07:37:56,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:37:56,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:37:56,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:37:56,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:37:56,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,911 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [26, 2, 10]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [0, 2, 1]. The 13 writes are split as follows [12, 0, 1]. [2025-03-04 07:37:56,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:37:56,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:37:56,930 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:37:56,930 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:37:56,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (1/1) ... [2025-03-04 07:37:56,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:37:56,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:56,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:37:56,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-03-04 07:37:56,971 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-03-04 07:37:56,971 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:37:56,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:37:56,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:37:57,066 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:37:57,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:37:57,306 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; [2025-03-04 07:37:57,450 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L787: havoc main_#t~mem38#1.base, main_#t~mem38#1.offset; [2025-03-04 07:37:57,473 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-03-04 07:37:57,473 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:37:57,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:37:57,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:37:57,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:37:57 BoogieIcfgContainer [2025-03-04 07:37:57,486 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:37:57,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:37:57,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:37:57,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:37:57,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:37:56" (1/3) ... [2025-03-04 07:37:57,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65226ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:37:57, skipping insertion in model container [2025-03-04 07:37:57,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:37:56" (2/3) ... [2025-03-04 07:37:57,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65226ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:37:57, skipping insertion in model container [2025-03-04 07:37:57,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:37:57" (3/3) ... [2025-03-04 07:37:57,494 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-2.i [2025-03-04 07:37:57,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:37:57,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-2.i that has 3 procedures, 233 locations, 1 initial locations, 11 loop locations, and 87 error locations. [2025-03-04 07:37:57,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:37:57,558 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7705f24f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:37:57,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-03-04 07:37:57,563 INFO L276 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-03-04 07:37:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:37:57,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:57,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:37:57,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:37:57,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash 9110949, now seen corresponding path program 1 times [2025-03-04 07:37:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620523029] [2025-03-04 07:37:57,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:57,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:37:57,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:37:57,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:57,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:37:57,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:57,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620523029] [2025-03-04 07:37:57,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620523029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:57,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:57,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:37:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107017410] [2025-03-04 07:37:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:57,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:37:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:57,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:37:57,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:37:57,702 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-03-04 07:37:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:57,737 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2025-03-04 07:37:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:37:57,738 INFO L78 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-03-04 07:37:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:57,747 INFO L225 Difference]: With dead ends: 233 [2025-03-04 07:37:57,748 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 07:37:57,749 INFO L434 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-03-04 07:37:57,751 INFO L435 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-03-04 07:37:57,753 INFO L436 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-03-04 07:37:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 07:37:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-04 07:37:57,793 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-03-04 07:37:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 261 transitions. [2025-03-04 07:37:57,803 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 261 transitions. Word has length 4 [2025-03-04 07:37:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:57,804 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 261 transitions. [2025-03-04 07:37:57,804 INFO L472 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-03-04 07:37:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 261 transitions. [2025-03-04 07:37:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:37:57,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:57,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:37:57,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:37:57,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:37:57,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash 165774362, now seen corresponding path program 1 times [2025-03-04 07:37:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:57,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336764514] [2025-03-04 07:37:57,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:57,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:37:57,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:37:57,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:57,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:37:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336764514] [2025-03-04 07:37:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336764514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:37:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106162471] [2025-03-04 07:37:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:57,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:37:57,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:57,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:37:57,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:37:57,968 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-03-04 07:37:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:58,135 INFO L93 Difference]: Finished difference Result 230 states and 260 transitions. [2025-03-04 07:37:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:37:58,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:37:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:58,137 INFO L225 Difference]: With dead ends: 230 [2025-03-04 07:37:58,137 INFO L226 Difference]: Without dead ends: 230 [2025-03-04 07:37:58,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:37:58,138 INFO L435 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-03-04 07:37:58,140 INFO L436 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-03-04 07:37:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-04 07:37:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-03-04 07:37:58,158 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-03-04 07:37:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 260 transitions. [2025-03-04 07:37:58,164 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 260 transitions. Word has length 6 [2025-03-04 07:37:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 260 transitions. [2025-03-04 07:37:58,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:37:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 260 transitions. [2025-03-04 07:37:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:37:58,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:58,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:37:58,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:37:58,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:37:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 844038027, now seen corresponding path program 1 times [2025-03-04 07:37:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474514733] [2025-03-04 07:37:58,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:58,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:37:58,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:37:58,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:58,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:58,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151591955] [2025-03-04 07:37:58,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:58,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:37:58,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:37:58,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:37:58,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:37:58,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:58,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:58,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:37:58,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:58,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:37:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:37:58,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:37:58,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:58,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474514733] [2025-03-04 07:37:58,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:37:58,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151591955] [2025-03-04 07:37:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151591955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:37:58,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:37:58,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:37:58,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984455250] [2025-03-04 07:37:58,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:58,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:37:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:58,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:37:58,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:37:58,355 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-03-04 07:37:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:58,474 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2025-03-04 07:37:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:37:58,475 INFO L78 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-03-04 07:37:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:58,476 INFO L225 Difference]: With dead ends: 239 [2025-03-04 07:37:58,476 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 07:37:58,476 INFO L434 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-03-04 07:37:58,477 INFO L435 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-03-04 07:37:58,477 INFO L436 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-03-04 07:37:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 07:37:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-04 07:37:58,489 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-03-04 07:37:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 269 transitions. [2025-03-04 07:37:58,491 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 269 transitions. Word has length 7 [2025-03-04 07:37:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:58,492 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 269 transitions. [2025-03-04 07:37:58,492 INFO L472 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-03-04 07:37:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 269 transitions. [2025-03-04 07:37:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:37:58,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:58,493 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-03-04 07:37:58,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:37:58,697 WARN L453 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-03-04 07:37:58,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:37:58,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash 362729511, now seen corresponding path program 1 times [2025-03-04 07:37:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:58,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441298122] [2025-03-04 07:37:58,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:58,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:37:58,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:37:58,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:58,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830503615] [2025-03-04 07:37:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:58,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:58,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:58,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:37:58,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:37:58,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:37:58,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:37:58,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:58,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:58,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 07:37:58,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:58,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-04 07:37:59,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:37:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 55 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 07:37:59,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:37:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 07:37:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:37:59,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441298122] [2025-03-04 07:37:59,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:37:59,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830503615] [2025-03-04 07:37:59,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830503615] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 07:37:59,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:37:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-04 07:37:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223415245] [2025-03-04 07:37:59,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:37:59,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:37:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:37:59,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:37:59,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:37:59,265 INFO L87 Difference]: Start difference. First operand 239 states and 269 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:37:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:37:59,302 INFO L93 Difference]: Finished difference Result 245 states and 275 transitions. [2025-03-04 07:37:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:37:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 66 [2025-03-04 07:37:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:37:59,304 INFO L225 Difference]: With dead ends: 245 [2025-03-04 07:37:59,304 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 07:37:59,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:37:59,305 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 11 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:37:59,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:37:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 07:37:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-04 07:37:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 139 states have (on average 1.7697841726618706) internal successors, (246), 224 states have internal predecessors, (246), 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-03-04 07:37:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2025-03-04 07:37:59,319 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 66 [2025-03-04 07:37:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:37:59,319 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2025-03-04 07:37:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:37:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2025-03-04 07:37:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 07:37:59,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:37:59,320 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-03-04 07:37:59,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:37:59,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 07:37:59,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:37:59,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:37:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash 175863998, now seen corresponding path program 1 times [2025-03-04 07:37:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:37:59,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275921886] [2025-03-04 07:37:59,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:37:59,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:37:59,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:37:59,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:59,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:37:59,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130288867] [2025-03-04 07:37:59,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:37:59,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:37:59,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:37:59,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:37:59,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:37:59,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:37:59,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:37:59,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:37:59,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:37:59,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 07:37:59,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:37:59,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:38:00,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:38:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 58 proven. 14 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 07:38:00,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 07:38:00,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:00,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275921886] [2025-03-04 07:38:00,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:00,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130288867] [2025-03-04 07:38:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130288867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:00,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-04 07:38:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545738131] [2025-03-04 07:38:00,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:00,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:38:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:00,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:38:00,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:38:00,224 INFO L87 Difference]: Start difference. First operand 240 states and 270 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-03-04 07:38:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:00,489 INFO L93 Difference]: Finished difference Result 260 states and 292 transitions. [2025-03-04 07:38:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:38:00,489 INFO L78 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-03-04 07:38:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:00,490 INFO L225 Difference]: With dead ends: 260 [2025-03-04 07:38:00,490 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 07:38:00,490 INFO L434 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-03-04 07:38:00,491 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 17 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:00,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1435 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:38:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 07:38:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-03-04 07:38:00,501 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-03-04 07:38:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2025-03-04 07:38:00,502 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 71 [2025-03-04 07:38:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:00,503 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2025-03-04 07:38:00,503 INFO L472 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-03-04 07:38:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2025-03-04 07:38:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 07:38:00,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:00,504 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-03-04 07:38:00,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:38:00,708 WARN L453 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-03-04 07:38:00,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:38:00,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2142160103, now seen corresponding path program 2 times [2025-03-04 07:38:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:00,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396676350] [2025-03-04 07:38:00,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:38:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:00,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 07:38:00,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 07:38:00,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:38:00,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697899678] [2025-03-04 07:38:00,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:38:00,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:00,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:00,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:38:00,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:38:00,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-04 07:38:01,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 07:38:01,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:38:01,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:01,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:38:01,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:01,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:38:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 07:38:01,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:38:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396676350] [2025-03-04 07:38:01,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697899678] [2025-03-04 07:38:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697899678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:38:01,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:38:01,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:38:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600840201] [2025-03-04 07:38:01,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:38:01,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:38:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:01,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:38:01,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:38:01,331 INFO L87 Difference]: Start difference. First operand 245 states and 275 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-03-04 07:38:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:01,437 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2025-03-04 07:38:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:38:01,437 INFO L78 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 86 [2025-03-04 07:38:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:01,438 INFO L225 Difference]: With dead ends: 244 [2025-03-04 07:38:01,438 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 07:38:01,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:38:01,439 INFO L435 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-03-04 07:38:01,439 INFO L436 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-03-04 07:38:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 07:38:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-04 07:38:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 228 states have internal predecessors, (250), 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-03-04 07:38:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 274 transitions. [2025-03-04 07:38:01,448 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 274 transitions. Word has length 86 [2025-03-04 07:38:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:01,448 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 274 transitions. [2025-03-04 07:38:01,449 INFO L472 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-03-04 07:38:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 274 transitions. [2025-03-04 07:38:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 07:38:01,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:01,451 INFO L218 NwaCegarLoop]: trace histogram [22, 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-03-04 07:38:01,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:38:01,651 WARN L453 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-03-04 07:38:01,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:38:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash -972136192, now seen corresponding path program 1 times [2025-03-04 07:38:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:01,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133642168] [2025-03-04 07:38:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:01,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:38:01,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:38:01,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:01,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-04 07:38:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133642168] [2025-03-04 07:38:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133642168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718202979] [2025-03-04 07:38:02,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:02,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:02,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:02,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:38:02,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:38:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:38:02,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:38:02,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:02,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:02,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:38:02,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:02,747 WARN L873 $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-03-04 07:38:02,779 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:38:02,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:38:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 1 refuted. 0 times theorem prover too weak. 255 trivial. 21 not checked. [2025-03-04 07:38:02,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:02,977 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:38:02,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:38:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-04 07:38:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718202979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:02,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2025-03-04 07:38:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722011584] [2025-03-04 07:38:02,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:02,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:38:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:02,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:38:02,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2025-03-04 07:38:02,999 INFO L87 Difference]: Start difference. First operand 244 states and 274 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 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-03-04 07:38:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:03,585 INFO L93 Difference]: Finished difference Result 343 states and 393 transitions. [2025-03-04 07:38:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:38:03,585 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 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 95 [2025-03-04 07:38:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:03,587 INFO L225 Difference]: With dead ends: 343 [2025-03-04 07:38:03,587 INFO L226 Difference]: Without dead ends: 343 [2025-03-04 07:38:03,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 181 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=311, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:38:03,588 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 343 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:03,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1859 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1032 Invalid, 0 Unknown, 370 Unchecked, 0.5s Time] [2025-03-04 07:38:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-04 07:38:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2025-03-04 07:38:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 144 states have (on average 1.7222222222222223) internal successors, (248), 226 states have internal predecessors, (248), 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-03-04 07:38:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 272 transitions. [2025-03-04 07:38:03,600 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 272 transitions. Word has length 95 [2025-03-04 07:38:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 272 transitions. [2025-03-04 07:38:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 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-03-04 07:38:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 272 transitions. [2025-03-04 07:38:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 07:38:03,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:03,604 INFO L218 NwaCegarLoop]: trace histogram [22, 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-03-04 07:38:03,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:38:03,804 WARN L453 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-03-04 07:38:03,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:38:03,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash -972136191, now seen corresponding path program 1 times [2025-03-04 07:38:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:03,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309866527] [2025-03-04 07:38:03,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:03,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:38:03,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:38:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 07:38:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164559106] [2025-03-04 07:38:03,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:03,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:03,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:03,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:38:03,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:38:04,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:38:04,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:38:04,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:04,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:04,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 07:38:04,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:04,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:38:04,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:38:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 304 proven. 76 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-04 07:38:04,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 96 proven. 64 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 07:38:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:04,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309866527] [2025-03-04 07:38:04,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 07:38:04,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164559106] [2025-03-04 07:38:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164559106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:04,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:04,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-04 07:38:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676127847] [2025-03-04 07:38:04,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:04,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:38:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:04,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:38:04,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:38:04,780 INFO L87 Difference]: Start difference. First operand 242 states and 272 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 07:38:17,066 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 07:38:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:21,551 INFO L93 Difference]: Finished difference Result 266 states and 302 transitions. [2025-03-04 07:38:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:38:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-03-04 07:38:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:21,553 INFO L225 Difference]: With dead ends: 266 [2025-03-04 07:38:21,553 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 07:38:21,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=307, Invalid=952, Unknown=1, NotChecked=0, Total=1260 [2025-03-04 07:38:21,555 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 32 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:21,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2672 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:38:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 07:38:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-04 07:38:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 153 states have (on average 1.6993464052287581) internal successors, (260), 235 states have internal predecessors, (260), 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-03-04 07:38:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 284 transitions. [2025-03-04 07:38:21,563 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 284 transitions. Word has length 95 [2025-03-04 07:38:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:21,564 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 284 transitions. [2025-03-04 07:38:21,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 07:38:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 284 transitions. [2025-03-04 07:38:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 07:38:21,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:21,566 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-04 07:38:21,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:38:21,770 WARN L453 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-03-04 07:38:21,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:38:21,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1039574081, now seen corresponding path program 2 times [2025-03-04 07:38:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:21,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994004404] [2025-03-04 07:38:21,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:38:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:21,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-04 07:38:21,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 07:38:21,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:38:21,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 493 proven. 70 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-03-04 07:38:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994004404] [2025-03-04 07:38:23,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994004404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093434936] [2025-03-04 07:38:23,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:38:23,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:23,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:23,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:38:23,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:38:24,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-04 07:38:25,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 07:38:25,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:38:25,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:25,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-04 07:38:25,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:25,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 07:38:31,217 WARN L873 $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-03-04 07:38:31,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:38:31,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:38:31,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:38:31,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:38:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 325 proven. 588 refuted. 0 times theorem prover too weak. 253 trivial. 82 not checked. [2025-03-04 07:38:31,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093434936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:31,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:38:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2025-03-04 07:38:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372171611] [2025-03-04 07:38:31,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 07:38:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:31,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 07:38:31,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2215, Unknown=2, NotChecked=94, Total=2450 [2025-03-04 07:38:31,534 INFO L87 Difference]: Start difference. First operand 251 states and 284 transitions. Second operand has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 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-03-04 07:38:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:37,160 INFO L93 Difference]: Finished difference Result 381 states and 445 transitions. [2025-03-04 07:38:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 07:38:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 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 115 [2025-03-04 07:38:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:37,162 INFO L225 Difference]: With dead ends: 381 [2025-03-04 07:38:37,162 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 07:38:37,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=323, Invalid=4371, Unknown=2, NotChecked=134, Total=4830 [2025-03-04 07:38:37,164 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 265 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 7443 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 7851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:37,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 2442 Invalid, 7851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 7443 Invalid, 0 Unknown, 389 Unchecked, 4.1s Time] [2025-03-04 07:38:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 07:38:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 249. [2025-03-04 07:38:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 153 states have (on average 1.6862745098039216) internal successors, (258), 233 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-03-04 07:38:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2025-03-04 07:38:37,172 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 115 [2025-03-04 07:38:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:37,172 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2025-03-04 07:38:37,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 43 states have internal predecessors, (83), 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-03-04 07:38:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2025-03-04 07:38:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 07:38:37,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:37,174 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-04 07:38:37,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:37,375 WARN L453 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-03-04 07:38:37,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:38:37,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1696682371, now seen corresponding path program 1 times [2025-03-04 07:38:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423427182] [2025-03-04 07:38:37,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:37,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 07:38:37,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 07:38:37,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:37,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 668 proven. 126 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-04 07:38:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423427182] [2025-03-04 07:38:38,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423427182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992954912] [2025-03-04 07:38:38,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:38,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:38,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:38,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:38:38,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:38:38,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 07:38:38,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 07:38:38,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:38,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:38,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:38:38,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:38,688 WARN L873 $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-03-04 07:38:38,715 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:38:38,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:38:38,755 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:38:38,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:38:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 2 refuted. 0 times theorem prover too weak. 488 trivial. 120 not checked. [2025-03-04 07:38:38,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:38:39,098 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:38:39,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:38:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 122 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-04 07:38:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992954912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:38:39,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:38:39,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 23 [2025-03-04 07:38:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128811154] [2025-03-04 07:38:39,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:38:39,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:38:39,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:38:39,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:38:39,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-03-04 07:38:39,118 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 07:38:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:38:39,876 INFO L93 Difference]: Finished difference Result 347 states and 400 transitions. [2025-03-04 07:38:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:38:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 117 [2025-03-04 07:38:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:38:39,878 INFO L225 Difference]: With dead ends: 347 [2025-03-04 07:38:39,878 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 07:38:39,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 224 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=655, Unknown=1, NotChecked=52, Total=812 [2025-03-04 07:38:39,878 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 797 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:38:39,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2408 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1480 Invalid, 0 Unknown, 365 Unchecked, 0.6s Time] [2025-03-04 07:38:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 07:38:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 246. [2025-03-04 07:38:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 153 states have (on average 1.6666666666666667) internal successors, (255), 230 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-03-04 07:38:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 279 transitions. [2025-03-04 07:38:39,885 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 279 transitions. Word has length 117 [2025-03-04 07:38:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:38:39,885 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 279 transitions. [2025-03-04 07:38:39,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 07:38:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 279 transitions. [2025-03-04 07:38:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 07:38:39,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:38:39,886 INFO L218 NwaCegarLoop]: trace histogram [42, 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-03-04 07:38:39,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:38:40,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:38:40,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 84 more)] === [2025-03-04 07:38:40,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:38:40,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1696682370, now seen corresponding path program 1 times [2025-03-04 07:38:40,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:38:40,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220156231] [2025-03-04 07:38:40,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:38:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 07:38:40,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 07:38:40,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:40,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 638 proven. 192 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-04 07:38:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:38:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220156231] [2025-03-04 07:38:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220156231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:38:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537640102] [2025-03-04 07:38:41,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:38:41,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:38:41,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:38:41,912 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:38:41,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:38:42,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 07:38:42,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 07:38:42,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:38:42,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:38:42,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-03-04 07:38:42,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:38:42,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1