./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03-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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:43:04,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:43:04,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:43:04,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:43:04,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:43:04,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:43:04,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:43:04,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:43:04,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:43:04,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:43:04,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:43:04,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:43:04,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:43:04,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:43:04,481 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:43:04,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:43:04,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:43:04,483 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:04,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:43:04,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:04,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:43:04,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:43:04,484 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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2025-04-30 10:43:04,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:43:04,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:43:04,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:43:04,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:43:04,723 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:43:04,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03-2.i [2025-04-30 10:43:06,044 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0931589b/57277a4156e240a5a0d77f0a3eb31601/FLAGdec0bfc49 [2025-04-30 10:43:06,309 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:43:06,310 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/length_test03-2.i [2025-04-30 10:43:06,323 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0931589b/57277a4156e240a5a0d77f0a3eb31601/FLAGdec0bfc49 [2025-04-30 10:43:07,093 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0931589b/57277a4156e240a5a0d77f0a3eb31601 [2025-04-30 10:43:07,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:43:07,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:43:07,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:43:07,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:43:07,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:43:07,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dffd892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07, skipping insertion in model container [2025-04-30 10:43:07,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:43:07,402 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:43:07,408 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:43:07,459 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:43:07,475 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:43:07,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07 WrapperNode [2025-04-30 10:43:07,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:43:07,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:43:07,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:43:07,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:43:07,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,513 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2025-04-30 10:43:07,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:43:07,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:43:07,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:43:07,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:43:07,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,539 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 6, 7]. [2025-04-30 10:43:07,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:43:07,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:43:07,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:43:07,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:43:07,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (1/1) ... [2025-04-30 10:43:07,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:07,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:07,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:43:07,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:43:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:43:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:43:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:43:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:43:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:43:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:43:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:43:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:43:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-04-30 10:43:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-04-30 10:43:07,672 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:43:07,673 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:43:07,975 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-04-30 10:43:07,977 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:43:07,988 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:43:07,989 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:43:07,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:43:07 BoogieIcfgContainer [2025-04-30 10:43:07,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:43:07,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:43:07,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:43:07,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:43:07,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:43:07" (1/3) ... [2025-04-30 10:43:07,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396ac3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:43:07, skipping insertion in model container [2025-04-30 10:43:07,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:07" (2/3) ... [2025-04-30 10:43:07,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396ac3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:43:07, skipping insertion in model container [2025-04-30 10:43:07,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:43:07" (3/3) ... [2025-04-30 10:43:07,998 INFO L128 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2025-04-30 10:43:08,007 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:43:08,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG length_test03-2.i that has 2 procedures, 126 locations, 135 edges, 1 initial locations, 4 loop locations, and 59 error locations. [2025-04-30 10:43:08,042 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:43:08,050 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d31a44a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:43:08,051 INFO L341 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-04-30 10:43:08,054 INFO L278 IsEmpty]: Start isEmpty. Operand has 126 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 122 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:08,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-30 10:43:08,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:08,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-30 10:43:08,058 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:08,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:08,062 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2025-04-30 10:43:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:08,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163786512] [2025-04-30 10:43:08,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:08,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:43:08,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:43:08,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:08,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:08,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163786512] [2025-04-30 10:43:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163786512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:08,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:08,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404527051] [2025-04-30 10:43:08,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:08,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:08,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:08,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,218 INFO L87 Difference]: Start difference. First operand has 126 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 122 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:08,358 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2025-04-30 10:43:08,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:08,359 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-30 10:43:08,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:08,364 INFO L225 Difference]: With dead ends: 162 [2025-04-30 10:43:08,365 INFO L226 Difference]: Without dead ends: 160 [2025-04-30 10:43:08,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,370 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:08,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 164 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-30 10:43:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2025-04-30 10:43:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 62 states have (on average 2.0) internal successors, (124), 118 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2025-04-30 10:43:08,401 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 3 [2025-04-30 10:43:08,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:08,402 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2025-04-30 10:43:08,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,402 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2025-04-30 10:43:08,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-04-30 10:43:08,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:08,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-04-30 10:43:08,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:43:08,405 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:08,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:08,406 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-04-30 10:43:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:08,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922897118] [2025-04-30 10:43:08,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:43:08,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:43:08,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:08,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922897118] [2025-04-30 10:43:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922897118] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:08,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58770336] [2025-04-30 10:43:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:08,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:08,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:08,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,493 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:08,570 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2025-04-30 10:43:08,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:08,570 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-04-30 10:43:08,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:08,571 INFO L225 Difference]: With dead ends: 122 [2025-04-30 10:43:08,571 INFO L226 Difference]: Without dead ends: 122 [2025-04-30 10:43:08,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,572 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:08,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 185 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-30 10:43:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-04-30 10:43:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 62 states have (on average 1.967741935483871) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2025-04-30 10:43:08,579 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 3 [2025-04-30 10:43:08,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:08,579 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2025-04-30 10:43:08,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,579 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2025-04-30 10:43:08,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:43:08,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:08,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:43:08,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:43:08,580 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:08,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2025-04-30 10:43:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:08,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910727754] [2025-04-30 10:43:08,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:08,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:08,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:43:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:43:08,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:08,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910727754] [2025-04-30 10:43:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910727754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001651204] [2025-04-30 10:43:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:08,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:08,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:08,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,647 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:08,734 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2025-04-30 10:43:08,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:08,734 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:43:08,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:08,735 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:43:08,735 INFO L226 Difference]: Without dead ends: 135 [2025-04-30 10:43:08,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,736 INFO L437 NwaCegarLoop]: 111 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:08,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 169 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-30 10:43:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2025-04-30 10:43:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 66 states have (on average 1.9242424242424243) internal successors, (127), 118 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2025-04-30 10:43:08,746 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2025-04-30 10:43:08,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:08,746 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2025-04-30 10:43:08,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,746 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2025-04-30 10:43:08,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:43:08,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:08,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:43:08,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:43:08,747 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:08,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2025-04-30 10:43:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:08,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528747043] [2025-04-30 10:43:08,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:08,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:43:08,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:43:08,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:08,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:08,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528747043] [2025-04-30 10:43:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528747043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:08,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343796998] [2025-04-30 10:43:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:08,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:08,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:08,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,841 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:08,905 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2025-04-30 10:43:08,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:08,906 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:43:08,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:08,906 INFO L225 Difference]: With dead ends: 122 [2025-04-30 10:43:08,906 INFO L226 Difference]: Without dead ends: 122 [2025-04-30 10:43:08,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,907 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:08,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 186 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-30 10:43:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-04-30 10:43:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 66 states have (on average 1.893939393939394) internal successors, (125), 116 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2025-04-30 10:43:08,911 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2025-04-30 10:43:08,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:08,911 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2025-04-30 10:43:08,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:08,911 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2025-04-30 10:43:08,914 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:43:08,914 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:08,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:08,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:43:08,915 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:08,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1036530456, now seen corresponding path program 1 times [2025-04-30 10:43:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:08,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953818419] [2025-04-30 10:43:08,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:08,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:43:08,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:43:08,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:08,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:08,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:08,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953818419] [2025-04-30 10:43:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953818419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:08,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:08,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:08,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363863971] [2025-04-30 10:43:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:08,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:08,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:08,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:08,989 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:09,060 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2025-04-30 10:43:09,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:09,061 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-04-30 10:43:09,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:09,062 INFO L225 Difference]: With dead ends: 115 [2025-04-30 10:43:09,062 INFO L226 Difference]: Without dead ends: 115 [2025-04-30 10:43:09,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:09,062 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:09,062 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-30 10:43:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-04-30 10:43:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 111 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-04-30 10:43:09,071 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2025-04-30 10:43:09,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:09,071 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-04-30 10:43:09,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:09,072 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-04-30 10:43:09,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:43:09,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:09,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:09,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:43:09,072 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:09,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:09,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1036530457, now seen corresponding path program 1 times [2025-04-30 10:43:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:09,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122191036] [2025-04-30 10:43:09,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:09,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:43:09,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:43:09,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:09,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:09,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122191036] [2025-04-30 10:43:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122191036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:09,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:09,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:09,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965545115] [2025-04-30 10:43:09,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:09,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:09,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:09,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:09,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:09,182 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:09,233 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2025-04-30 10:43:09,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:09,234 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-04-30 10:43:09,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:09,234 INFO L225 Difference]: With dead ends: 110 [2025-04-30 10:43:09,234 INFO L226 Difference]: Without dead ends: 110 [2025-04-30 10:43:09,235 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:09,235 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 35 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:09,235 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-30 10:43:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-04-30 10:43:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 106 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2025-04-30 10:43:09,244 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 12 [2025-04-30 10:43:09,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:09,244 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2025-04-30 10:43:09,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:09,244 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2025-04-30 10:43:09,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:43:09,245 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:09,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:09,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:43:09,245 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:09,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2067673143, now seen corresponding path program 1 times [2025-04-30 10:43:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:09,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958589664] [2025-04-30 10:43:09,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:09,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:09,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:43:09,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:43:09,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:09,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:09,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958589664] [2025-04-30 10:43:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958589664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:43:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501677537] [2025-04-30 10:43:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:09,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:43:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:09,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:43:09,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:09,418 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:09,675 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2025-04-30 10:43:09,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:43:09,675 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2025-04-30 10:43:09,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:09,676 INFO L225 Difference]: With dead ends: 214 [2025-04-30 10:43:09,676 INFO L226 Difference]: Without dead ends: 214 [2025-04-30 10:43:09,676 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:43:09,677 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 157 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:09,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 275 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:43:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-30 10:43:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 143. [2025-04-30 10:43:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.6538461538461537) internal successors, (172), 138 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions. [2025-04-30 10:43:09,681 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 13 [2025-04-30 10:43:09,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:09,681 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions. [2025-04-30 10:43:09,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:09,682 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions. [2025-04-30 10:43:09,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:43:09,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:09,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:09,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:43:09,682 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:09,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2067673144, now seen corresponding path program 1 times [2025-04-30 10:43:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:09,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250975531] [2025-04-30 10:43:09,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:09,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:43:09,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:43:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:09,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250975531] [2025-04-30 10:43:09,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250975531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:09,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:09,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:43:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840015594] [2025-04-30 10:43:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:09,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:43:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:09,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:43:09,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:09,915 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:10,039 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2025-04-30 10:43:10,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:43:10,039 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2025-04-30 10:43:10,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:10,040 INFO L225 Difference]: With dead ends: 165 [2025-04-30 10:43:10,040 INFO L226 Difference]: Without dead ends: 165 [2025-04-30 10:43:10,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:43:10,041 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 25 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:10,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 269 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-30 10:43:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2025-04-30 10:43:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.5853658536585367) internal successors, (195), 157 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:43:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2025-04-30 10:43:10,051 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 13 [2025-04-30 10:43:10,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:10,051 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2025-04-30 10:43:10,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:10,051 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2025-04-30 10:43:10,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:43:10,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:10,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:10,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:43:10,051 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:10,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash 133639123, now seen corresponding path program 1 times [2025-04-30 10:43:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:10,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231678333] [2025-04-30 10:43:10,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:10,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:43:10,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:43:10,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:10,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:10,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231678333] [2025-04-30 10:43:10,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231678333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:10,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:43:10,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501190954] [2025-04-30 10:43:10,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:10,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:43:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:10,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:43:10,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:43:10,407 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:10,597 INFO L93 Difference]: Finished difference Result 165 states and 200 transitions. [2025-04-30 10:43:10,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:43:10,597 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2025-04-30 10:43:10,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:10,598 INFO L225 Difference]: With dead ends: 165 [2025-04-30 10:43:10,598 INFO L226 Difference]: Without dead ends: 165 [2025-04-30 10:43:10,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:43:10,599 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 38 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:10,599 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 644 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-30 10:43:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2025-04-30 10:43:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.5772357723577235) internal successors, (194), 157 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:43:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 200 transitions. [2025-04-30 10:43:10,605 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 200 transitions. Word has length 22 [2025-04-30 10:43:10,605 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:10,605 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 200 transitions. [2025-04-30 10:43:10,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:10,605 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 200 transitions. [2025-04-30 10:43:10,606 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:43:10,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:10,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:10,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:43:10,607 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:10,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1939446006, now seen corresponding path program 1 times [2025-04-30 10:43:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:10,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109287149] [2025-04-30 10:43:10,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:10,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:43:10,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:43:10,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:10,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:10,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109287149] [2025-04-30 10:43:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109287149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:10,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:43:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118309330] [2025-04-30 10:43:10,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:10,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:43:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:10,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:43:10,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:43:10,978 INFO L87 Difference]: Start difference. First operand 163 states and 200 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:11,216 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2025-04-30 10:43:11,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:43:11,217 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 24 [2025-04-30 10:43:11,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:11,217 INFO L225 Difference]: With dead ends: 189 [2025-04-30 10:43:11,218 INFO L226 Difference]: Without dead ends: 189 [2025-04-30 10:43:11,218 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:43:11,218 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 148 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:11,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 497 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:43:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-04-30 10:43:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 154. [2025-04-30 10:43:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 115 states have (on average 1.5739130434782609) internal successors, (181), 148 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:43:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2025-04-30 10:43:11,222 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 187 transitions. Word has length 24 [2025-04-30 10:43:11,222 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:11,222 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 187 transitions. [2025-04-30 10:43:11,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:11,222 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 187 transitions. [2025-04-30 10:43:11,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:43:11,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:11,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:11,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:43:11,223 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:11,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1361992267, now seen corresponding path program 1 times [2025-04-30 10:43:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:11,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641815849] [2025-04-30 10:43:11,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:43:11,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:43:11,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:11,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641815849] [2025-04-30 10:43:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641815849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:11,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:43:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717435580] [2025-04-30 10:43:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:11,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:11,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:11,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:11,284 INFO L87 Difference]: Start difference. First operand 154 states and 187 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:43:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:11,299 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2025-04-30 10:43:11,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:11,299 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-04-30 10:43:11,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:11,300 INFO L225 Difference]: With dead ends: 147 [2025-04-30 10:43:11,300 INFO L226 Difference]: Without dead ends: 147 [2025-04-30 10:43:11,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:11,301 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:11,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 197 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-30 10:43:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2025-04-30 10:43:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 129 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:43:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2025-04-30 10:43:11,306 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 29 [2025-04-30 10:43:11,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:11,307 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2025-04-30 10:43:11,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:43:11,307 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2025-04-30 10:43:11,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:43:11,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:11,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:11,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:43:11,308 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:11,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1025754038, now seen corresponding path program 1 times [2025-04-30 10:43:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:11,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932039576] [2025-04-30 10:43:11,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:43:11,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:43:11,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:11,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:11,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:11,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932039576] [2025-04-30 10:43:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932039576] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:11,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926032375] [2025-04-30 10:43:11,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:11,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:11,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:11,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:11,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:43:11,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:43:11,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:43:11,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:11,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:11,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:43:11,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:11,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:11,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-30 10:43:11,980 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:43:11,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:43:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:11,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:12,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-04-30 10:43:12,267 INFO L325 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-04-30 10:43:12,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-04-30 10:43:12,415 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:12,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2025-04-30 10:43:12,517 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:12,517 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2025-04-30 10:43:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926032375] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:12,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-04-30 10:43:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766253383] [2025-04-30 10:43:12,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:12,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:43:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:12,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:43:12,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:43:12,601 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 20 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:13,144 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2025-04-30 10:43:13,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:43:13,144 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 20 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-04-30 10:43:13,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:13,146 INFO L225 Difference]: With dead ends: 169 [2025-04-30 10:43:13,146 INFO L226 Difference]: Without dead ends: 169 [2025-04-30 10:43:13,146 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:43:13,147 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 544 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:13,147 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 450 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:43:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-30 10:43:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 134. [2025-04-30 10:43:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 128 states have internal predecessors, (139), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-30 10:43:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2025-04-30 10:43:13,150 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 31 [2025-04-30 10:43:13,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:13,150 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2025-04-30 10:43:13,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 20 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:13,151 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2025-04-30 10:43:13,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:43:13,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:13,167 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:13,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:13,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:43:13,368 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:13,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash -555625539, now seen corresponding path program 1 times [2025-04-30 10:43:13,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:13,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195657181] [2025-04-30 10:43:13,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:13,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:43:13,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:43:13,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:13,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:13,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:13,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195657181] [2025-04-30 10:43:13,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195657181] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:13,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739158957] [2025-04-30 10:43:13,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:13,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:13,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:13,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:43:13,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:43:13,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:43:13,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:13,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:13,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:43:13,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:13,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:13,692 WARN L871 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1))) is different from true [2025-04-30 10:43:13,727 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:43:13,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:43:13,747 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:43:13,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:43:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-30 10:43:13,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739158957] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:13,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 10 [2025-04-30 10:43:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647102342] [2025-04-30 10:43:13,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:13,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:43:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:13,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:43:13,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2025-04-30 10:43:13,903 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:43:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:14,288 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2025-04-30 10:43:14,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:43:14,288 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-04-30 10:43:14,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:14,289 INFO L225 Difference]: With dead ends: 168 [2025-04-30 10:43:14,289 INFO L226 Difference]: Without dead ends: 168 [2025-04-30 10:43:14,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=304, Unknown=1, NotChecked=38, Total=462 [2025-04-30 10:43:14,289 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 120 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:14,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 357 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 0 Unknown, 141 Unchecked, 0.2s Time] [2025-04-30 10:43:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-30 10:43:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2025-04-30 10:43:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 106 states have (on average 1.4056603773584906) internal successors, (149), 136 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-30 10:43:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2025-04-30 10:43:14,296 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 32 [2025-04-30 10:43:14,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:14,296 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2025-04-30 10:43:14,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-30 10:43:14,296 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2025-04-30 10:43:14,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-30 10:43:14,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:14,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:14,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:14,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:43:14,499 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:14,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -555625538, now seen corresponding path program 1 times [2025-04-30 10:43:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:14,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666422691] [2025-04-30 10:43:14,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:43:14,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:43:14,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:14,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:14,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666422691] [2025-04-30 10:43:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666422691] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:14,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135209062] [2025-04-30 10:43:14,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:14,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:14,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:14,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:43:14,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-30 10:43:14,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-30 10:43:14,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:14,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:14,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:43:14,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:14,892 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:14,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:43:14,936 WARN L871 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2025-04-30 10:43:15,019 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:43:15,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:43:15,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:43:15,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:15,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-04-30 10:43:15,141 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:43:15,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-30 10:43:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-30 10:43:15,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:15,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135209062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:15,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:43:15,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2025-04-30 10:43:15,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176109623] [2025-04-30 10:43:15,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:15,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:43:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:15,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:43:15,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2025-04-30 10:43:15,335 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:20,275 INFO L93 Difference]: Finished difference Result 295 states and 327 transitions. [2025-04-30 10:43:20,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:43:20,275 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-04-30 10:43:20,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:20,277 INFO L225 Difference]: With dead ends: 295 [2025-04-30 10:43:20,277 INFO L226 Difference]: Without dead ends: 295 [2025-04-30 10:43:20,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=204, Invalid=853, Unknown=3, NotChecked=62, Total=1122 [2025-04-30 10:43:20,278 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 298 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:20,278 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 527 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 649 Invalid, 0 Unknown, 235 Unchecked, 0.5s Time] [2025-04-30 10:43:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-04-30 10:43:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2025-04-30 10:43:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 177 states have internal predecessors, (210), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:43:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 222 transitions. [2025-04-30 10:43:20,283 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 222 transitions. Word has length 32 [2025-04-30 10:43:20,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:20,283 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 222 transitions. [2025-04-30 10:43:20,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:20,284 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 222 transitions. [2025-04-30 10:43:20,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:43:20,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:20,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:20,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:43:20,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:20,485 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:20,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash -3365355, now seen corresponding path program 1 times [2025-04-30 10:43:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:20,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123508238] [2025-04-30 10:43:20,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:20,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:43:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:43:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:20,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123508238] [2025-04-30 10:43:20,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123508238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:20,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917939437] [2025-04-30 10:43:20,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:20,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:20,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:20,877 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:20,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:43:20,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:43:20,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:43:20,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:20,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:20,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-30 10:43:20,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:21,003 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:21,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:43:21,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 22 [2025-04-30 10:43:21,164 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:43:21,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-04-30 10:43:21,236 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:21,236 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 12 [2025-04-30 10:43:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:21,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:21,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2025-04-30 10:43:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:22,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917939437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:22,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:22,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2025-04-30 10:43:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408386795] [2025-04-30 10:43:22,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:22,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:43:22,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:22,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:43:22,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:43:22,018 INFO L87 Difference]: Start difference. First operand 187 states and 222 transitions. Second operand has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:22,858 INFO L93 Difference]: Finished difference Result 234 states and 283 transitions. [2025-04-30 10:43:22,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:43:22,860 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-04-30 10:43:22,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:22,861 INFO L225 Difference]: With dead ends: 234 [2025-04-30 10:43:22,861 INFO L226 Difference]: Without dead ends: 234 [2025-04-30 10:43:22,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:43:22,862 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 199 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:22,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 805 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:43:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-30 10:43:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 193. [2025-04-30 10:43:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 183 states have internal predecessors, (214), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:43:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2025-04-30 10:43:22,872 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 40 [2025-04-30 10:43:22,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:22,872 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2025-04-30 10:43:22,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:22,872 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2025-04-30 10:43:22,874 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:43:22,874 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:22,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:22,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:43:23,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:43:23,075 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:23,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash -3365354, now seen corresponding path program 1 times [2025-04-30 10:43:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:23,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632807784] [2025-04-30 10:43:23,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:23,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:43:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:43:23,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:23,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:23,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:23,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632807784] [2025-04-30 10:43:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632807784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:23,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494586510] [2025-04-30 10:43:23,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:23,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:23,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:23,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:23,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:43:23,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:43:23,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:43:23,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:23,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:23,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-30 10:43:23,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:23,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:23,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:43:23,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:23,860 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:43:23,961 INFO L325 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-04-30 10:43:23,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-30 10:43:23,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-30 10:43:24,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:43:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:24,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:24,344 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2025-04-30 10:43:24,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2025-04-30 10:43:24,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-04-30 10:43:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494586510] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:24,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:24,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 21 [2025-04-30 10:43:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879623396] [2025-04-30 10:43:24,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:24,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:43:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:24,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:43:24,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:43:24,547 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 22 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:25,184 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2025-04-30 10:43:25,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:43:25,185 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-04-30 10:43:25,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:25,185 INFO L225 Difference]: With dead ends: 195 [2025-04-30 10:43:25,186 INFO L226 Difference]: Without dead ends: 195 [2025-04-30 10:43:25,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:43:25,186 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 165 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:25,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 679 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:43:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-30 10:43:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-04-30 10:43:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 183 states have internal predecessors, (213), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:43:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2025-04-30 10:43:25,190 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 40 [2025-04-30 10:43:25,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:25,191 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2025-04-30 10:43:25,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:25,191 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2025-04-30 10:43:25,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:43:25,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:25,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:25,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:25,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:43:25,396 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:25,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1389617395, now seen corresponding path program 1 times [2025-04-30 10:43:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:25,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411620132] [2025-04-30 10:43:25,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:25,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:43:25,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:43:25,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:25,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:25,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411620132] [2025-04-30 10:43:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411620132] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:25,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369729639] [2025-04-30 10:43:25,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:25,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:25,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:25,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:25,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:43:25,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:43:25,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:43:25,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:25,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:25,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-30 10:43:25,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:25,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:25,990 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:43:25,991 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:43:25,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:43:25,999 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:43:26,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2025-04-30 10:43:26,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-30 10:43:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:26,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:26,329 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1271 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1271) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0)) (forall ((v_ArrVal_1270 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0))) is different from false [2025-04-30 10:43:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369729639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:26,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:43:26,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2025-04-30 10:43:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300247372] [2025-04-30 10:43:26,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:26,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:43:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:26,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:43:26,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2025-04-30 10:43:26,332 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:26,791 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2025-04-30 10:43:26,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:43:26,793 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-04-30 10:43:26,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:26,794 INFO L225 Difference]: With dead ends: 265 [2025-04-30 10:43:26,794 INFO L226 Difference]: Without dead ends: 265 [2025-04-30 10:43:26,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=490, Unknown=1, NotChecked=46, Total=650 [2025-04-30 10:43:26,795 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 201 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:26,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 695 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:43:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-30 10:43:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 205. [2025-04-30 10:43:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 164 states have (on average 1.3658536585365855) internal successors, (224), 193 states have internal predecessors, (224), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-04-30 10:43:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 240 transitions. [2025-04-30 10:43:26,801 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 240 transitions. Word has length 41 [2025-04-30 10:43:26,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:26,801 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 240 transitions. [2025-04-30 10:43:26,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 15 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:26,802 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 240 transitions. [2025-04-30 10:43:26,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:43:26,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:26,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:26,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:43:27,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:43:27,003 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:27,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1621187152, now seen corresponding path program 1 times [2025-04-30 10:43:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:27,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323526590] [2025-04-30 10:43:27,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:27,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:43:27,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:43:27,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:27,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:27,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323526590] [2025-04-30 10:43:27,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323526590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:27,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323701951] [2025-04-30 10:43:27,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:27,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:27,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:27,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:27,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:43:27,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:43:28,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:43:28,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:28,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:28,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:43:28,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:28,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:28,028 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:43:28,028 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:43:28,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:43:28,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:43:28,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:43:28,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:43:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:28,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323701951] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:29,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:43:29,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 32 [2025-04-30 10:43:29,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234804453] [2025-04-30 10:43:29,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:29,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:43:29,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:29,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:43:29,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=912, Unknown=11, NotChecked=0, Total=1056 [2025-04-30 10:43:29,269 INFO L87 Difference]: Start difference. First operand 205 states and 240 transitions. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 29 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:30,143 INFO L93 Difference]: Finished difference Result 285 states and 326 transitions. [2025-04-30 10:43:30,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:43:30,144 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 29 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-04-30 10:43:30,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:30,145 INFO L225 Difference]: With dead ends: 285 [2025-04-30 10:43:30,145 INFO L226 Difference]: Without dead ends: 285 [2025-04-30 10:43:30,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=376, Invalid=1869, Unknown=11, NotChecked=0, Total=2256 [2025-04-30 10:43:30,146 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 297 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:30,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 714 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:43:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-04-30 10:43:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 222. [2025-04-30 10:43:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.3463687150837989) internal successors, (241), 210 states have internal predecessors, (241), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-04-30 10:43:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 259 transitions. [2025-04-30 10:43:30,153 INFO L79 Accepts]: Start accepts. Automaton has 222 states and 259 transitions. Word has length 43 [2025-04-30 10:43:30,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:30,153 INFO L485 AbstractCegarLoop]: Abstraction has 222 states and 259 transitions. [2025-04-30 10:43:30,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 29 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:30,153 INFO L278 IsEmpty]: Start isEmpty. Operand 222 states and 259 transitions. [2025-04-30 10:43:30,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:43:30,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:30,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:30,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:43:30,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:30,354 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:30,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:30,355 INFO L85 PathProgramCache]: Analyzing trace with hash 262884515, now seen corresponding path program 1 times [2025-04-30 10:43:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:30,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121679518] [2025-04-30 10:43:30,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:30,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:30,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:43:30,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:43:30,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:30,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:43:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:30,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121679518] [2025-04-30 10:43:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121679518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:30,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236475412] [2025-04-30 10:43:30,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:30,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:30,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:30,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:43:30,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:43:30,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:43:30,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:30,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:30,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:43:30,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:43:30,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:43:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236475412] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:30,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-30 10:43:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116002910] [2025-04-30 10:43:30,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:30,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:43:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:43:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:30,574 INFO L87 Difference]: Start difference. First operand 222 states and 259 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:43:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:30,608 INFO L93 Difference]: Finished difference Result 260 states and 305 transitions. [2025-04-30 10:43:30,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:43:30,608 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2025-04-30 10:43:30,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:30,609 INFO L225 Difference]: With dead ends: 260 [2025-04-30 10:43:30,609 INFO L226 Difference]: Without dead ends: 260 [2025-04-30 10:43:30,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:30,610 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 73 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:30,610 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 275 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-30 10:43:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2025-04-30 10:43:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 203 states have (on average 1.354679802955665) internal successors, (275), 232 states have internal predecessors, (275), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2025-04-30 10:43:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2025-04-30 10:43:30,615 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 46 [2025-04-30 10:43:30,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:30,615 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2025-04-30 10:43:30,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:43:30,615 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2025-04-30 10:43:30,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:43:30,616 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:30,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:30,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:43:30,816 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:30,817 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:30,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash 856676220, now seen corresponding path program 1 times [2025-04-30 10:43:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:30,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489507695] [2025-04-30 10:43:30,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:30,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:43:30,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:43:30,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:30,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:31,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489507695] [2025-04-30 10:43:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489507695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:31,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603379461] [2025-04-30 10:43:31,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:31,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:31,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:31,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:43:31,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:43:31,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:43:31,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:31,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:31,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:43:31,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:31,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:31,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:43:31,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 22 [2025-04-30 10:43:31,545 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-30 10:43:31,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-04-30 10:43:31,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:43:31,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 12 [2025-04-30 10:43:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:31,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:31,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2025-04-30 10:43:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603379461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:32,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 23 [2025-04-30 10:43:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934569668] [2025-04-30 10:43:32,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:32,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:43:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:32,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:43:32,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:43:32,234 INFO L87 Difference]: Start difference. First operand 250 states and 305 transitions. Second operand has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:43:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:33,208 INFO L93 Difference]: Finished difference Result 406 states and 499 transitions. [2025-04-30 10:43:33,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:43:33,209 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2025-04-30 10:43:33,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:33,210 INFO L225 Difference]: With dead ends: 406 [2025-04-30 10:43:33,210 INFO L226 Difference]: Without dead ends: 406 [2025-04-30 10:43:33,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=1233, Unknown=0, NotChecked=0, Total=1482 [2025-04-30 10:43:33,211 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 446 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:33,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 763 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:43:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-04-30 10:43:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 250. [2025-04-30 10:43:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 204 states have (on average 1.338235294117647) internal successors, (273), 232 states have internal predecessors, (273), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-04-30 10:43:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 297 transitions. [2025-04-30 10:43:33,217 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 297 transitions. Word has length 58 [2025-04-30 10:43:33,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:33,217 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 297 transitions. [2025-04-30 10:43:33,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:43:33,217 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 297 transitions. [2025-04-30 10:43:33,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:43:33,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:33,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:33,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:43:33,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:33,421 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:33,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash 856676221, now seen corresponding path program 1 times [2025-04-30 10:43:33,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:33,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141894946] [2025-04-30 10:43:33,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:33,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:33,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:43:33,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:43:33,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:33,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:35,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141894946] [2025-04-30 10:43:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141894946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:35,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977248578] [2025-04-30 10:43:35,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:35,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:35,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:35,096 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:35,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:43:35,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-30 10:43:35,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:43:35,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:35,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:35,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:43:35,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:35,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:35,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:43:35,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:43:35,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:43:35,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 27 [2025-04-30 10:43:35,502 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-30 10:43:35,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-30 10:43:35,506 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:43:35,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-04-30 10:43:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:35,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:35,977 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2025-04-30 10:43:35,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-04-30 10:43:36,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2025-04-30 10:43:36,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:43:36,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:43:36,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:43:36,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:43:36,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:43:36,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:43:37,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-04-30 10:43:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:37,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977248578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:37,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:37,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 8, 6] total 42 [2025-04-30 10:43:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17898035] [2025-04-30 10:43:37,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:37,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:43:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:37,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:43:37,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1647, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:43:37,136 INFO L87 Difference]: Start difference. First operand 250 states and 297 transitions. Second operand has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 42 states have internal predecessors, (132), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:43:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:39,608 INFO L93 Difference]: Finished difference Result 435 states and 518 transitions. [2025-04-30 10:43:39,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-30 10:43:39,608 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 42 states have internal predecessors, (132), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2025-04-30 10:43:39,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:39,610 INFO L225 Difference]: With dead ends: 435 [2025-04-30 10:43:39,610 INFO L226 Difference]: Without dead ends: 435 [2025-04-30 10:43:39,611 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 112 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=953, Invalid=5853, Unknown=0, NotChecked=0, Total=6806 [2025-04-30 10:43:39,611 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 733 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:39,611 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 788 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-30 10:43:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-04-30 10:43:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 249. [2025-04-30 10:43:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.3284313725490196) internal successors, (271), 231 states have internal predecessors, (271), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-04-30 10:43:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 295 transitions. [2025-04-30 10:43:39,617 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 295 transitions. Word has length 58 [2025-04-30 10:43:39,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:39,617 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 295 transitions. [2025-04-30 10:43:39,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 42 states have internal predecessors, (132), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:43:39,617 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 295 transitions. [2025-04-30 10:43:39,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:43:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:39,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:39,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:43:39,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-30 10:43:39,818 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:39,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1324790268, now seen corresponding path program 1 times [2025-04-30 10:43:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:39,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430794589] [2025-04-30 10:43:39,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:39,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:43:39,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:43:39,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:39,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-30 10:43:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:39,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430794589] [2025-04-30 10:43:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430794589] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:39,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620628361] [2025-04-30 10:43:39,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:39,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:39,860 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:39,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:43:39,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:43:40,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:43:40,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:40,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:40,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:43:40,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:43:40,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:43:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620628361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:43:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-04-30 10:43:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529749495] [2025-04-30 10:43:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:40,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:40,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:40,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:40,034 INFO L87 Difference]: Start difference. First operand 249 states and 295 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:40,039 INFO L93 Difference]: Finished difference Result 243 states and 287 transitions. [2025-04-30 10:43:40,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:40,042 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2025-04-30 10:43:40,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:40,043 INFO L225 Difference]: With dead ends: 243 [2025-04-30 10:43:40,043 INFO L226 Difference]: Without dead ends: 243 [2025-04-30 10:43:40,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:40,044 INFO L437 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:40,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-04-30 10:43:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-04-30 10:43:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.321608040201005) internal successors, (263), 225 states have internal predecessors, (263), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-04-30 10:43:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2025-04-30 10:43:40,050 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 64 [2025-04-30 10:43:40,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:40,050 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2025-04-30 10:43:40,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:43:40,051 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2025-04-30 10:43:40,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-30 10:43:40,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:40,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:40,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:40,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:43:40,252 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:40,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1493561582, now seen corresponding path program 1 times [2025-04-30 10:43:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:40,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254598022] [2025-04-30 10:43:40,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:40,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:43:40,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:43:40,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:40,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:40,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254598022] [2025-04-30 10:43:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254598022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:40,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713673898] [2025-04-30 10:43:40,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:40,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:40,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:40,790 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:40,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:43:40,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-30 10:43:40,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-30 10:43:40,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:40,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:40,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:43:40,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:41,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:43:41,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:41,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-30 10:43:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:43:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713673898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:41,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 29 [2025-04-30 10:43:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350507384] [2025-04-30 10:43:41,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:41,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-30 10:43:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:41,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-30 10:43:41,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:43:41,330 INFO L87 Difference]: Start difference. First operand 243 states and 287 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 26 states have internal predecessors, (114), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:43:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:42,274 INFO L93 Difference]: Finished difference Result 257 states and 306 transitions. [2025-04-30 10:43:42,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-30 10:43:42,275 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 26 states have internal predecessors, (114), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 70 [2025-04-30 10:43:42,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:42,275 INFO L225 Difference]: With dead ends: 257 [2025-04-30 10:43:42,276 INFO L226 Difference]: Without dead ends: 257 [2025-04-30 10:43:42,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=591, Invalid=2949, Unknown=0, NotChecked=0, Total=3540 [2025-04-30 10:43:42,277 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 224 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:42,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1265 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:43:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-04-30 10:43:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2025-04-30 10:43:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 191 states have (on average 1.324607329842932) internal successors, (253), 216 states have internal predecessors, (253), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-04-30 10:43:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 275 transitions. [2025-04-30 10:43:42,285 INFO L79 Accepts]: Start accepts. Automaton has 234 states and 275 transitions. Word has length 70 [2025-04-30 10:43:42,286 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:42,286 INFO L485 AbstractCegarLoop]: Abstraction has 234 states and 275 transitions. [2025-04-30 10:43:42,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 26 states have internal predecessors, (114), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-30 10:43:42,286 INFO L278 IsEmpty]: Start isEmpty. Operand 234 states and 275 transitions. [2025-04-30 10:43:42,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-04-30 10:43:42,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:42,287 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:42,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:42,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-30 10:43:42,488 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:42,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash 263350938, now seen corresponding path program 2 times [2025-04-30 10:43:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:42,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213530337] [2025-04-30 10:43:42,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:43:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:42,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-04-30 10:43:42,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-30 10:43:42,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:43:42,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:43,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213530337] [2025-04-30 10:43:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213530337] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:43,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277848289] [2025-04-30 10:43:43,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:43:43,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:43,042 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:43,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:43:43,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-04-30 10:43:43,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-30 10:43:43,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:43:43,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:43,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-30 10:43:43,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:43,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:43:43,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:43:43,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:43,422 INFO L325 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-04-30 10:43:43,422 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-04-30 10:43:43,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2025-04-30 10:43:43,596 WARN L871 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2025-04-30 10:43:43,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-30 10:43:43,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:43:43,614 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-04-30 10:43:43,626 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:43:43,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-30 10:43:43,721 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:43:43,721 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:43:43,813 INFO L325 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-04-30 10:43:43,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2025-04-30 10:43:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-30 10:43:43,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277848289] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:44,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:43:44,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2025-04-30 10:43:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550522732] [2025-04-30 10:43:44,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:44,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:43:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:44,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:43:44,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=761, Unknown=1, NotChecked=56, Total=930 [2025-04-30 10:43:44,173 INFO L87 Difference]: Start difference. First operand 234 states and 275 transitions. Second operand has 28 states, 27 states have (on average 4.666666666666667) internal successors, (126), 23 states have internal predecessors, (126), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:43:48,231 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:43:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:49,038 INFO L93 Difference]: Finished difference Result 250 states and 288 transitions. [2025-04-30 10:43:49,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:43:49,039 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.666666666666667) internal successors, (126), 23 states have internal predecessors, (126), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 72 [2025-04-30 10:43:49,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:49,040 INFO L225 Difference]: With dead ends: 250 [2025-04-30 10:43:49,040 INFO L226 Difference]: Without dead ends: 250 [2025-04-30 10:43:49,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=1540, Unknown=1, NotChecked=82, Total=1892 [2025-04-30 10:43:49,041 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 347 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:49,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 629 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 737 Invalid, 1 Unknown, 139 Unchecked, 4.5s Time] [2025-04-30 10:43:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-30 10:43:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 159. [2025-04-30 10:43:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 149 states have internal predecessors, (165), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:43:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2025-04-30 10:43:49,048 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 72 [2025-04-30 10:43:49,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:49,048 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2025-04-30 10:43:49,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.666666666666667) internal successors, (126), 23 states have internal predecessors, (126), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:43:49,048 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2025-04-30 10:43:49,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-04-30 10:43:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:49,049 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:49,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:43:49,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-30 10:43:49,250 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:49,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1343724172, now seen corresponding path program 2 times [2025-04-30 10:43:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:49,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012243900] [2025-04-30 10:43:49,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:43:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:49,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-04-30 10:43:49,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-04-30 10:43:49,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:43:49,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-04-30 10:43:49,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:49,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012243900] [2025-04-30 10:43:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012243900] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:49,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246350346] [2025-04-30 10:43:49,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:43:49,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:49,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:49,391 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:49,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:43:49,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-04-30 10:43:49,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-04-30 10:43:49,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:43:49,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:49,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:43:49,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-04-30 10:43:49,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-04-30 10:43:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246350346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:49,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-04-30 10:43:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388941863] [2025-04-30 10:43:49,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:49,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:43:49,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:49,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:43:49,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:43:49,946 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:43:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:49,987 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2025-04-30 10:43:49,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:43:49,987 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 97 [2025-04-30 10:43:49,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:49,988 INFO L225 Difference]: With dead ends: 197 [2025-04-30 10:43:49,988 INFO L226 Difference]: Without dead ends: 197 [2025-04-30 10:43:49,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:43:49,989 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 172 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:49,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 198 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-30 10:43:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 177. [2025-04-30 10:43:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 165 states have internal predecessors, (191), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:43:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 207 transitions. [2025-04-30 10:43:49,992 INFO L79 Accepts]: Start accepts. Automaton has 177 states and 207 transitions. Word has length 97 [2025-04-30 10:43:49,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:49,992 INFO L485 AbstractCegarLoop]: Abstraction has 177 states and 207 transitions. [2025-04-30 10:43:49,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-04-30 10:43:49,992 INFO L278 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2025-04-30 10:43:49,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-04-30 10:43:49,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:49,993 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:50,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:50,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:50,193 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:43:50,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:50,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1912909484, now seen corresponding path program 3 times [2025-04-30 10:43:50,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:50,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845282750] [2025-04-30 10:43:50,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:43:50,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:50,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 7 equivalence classes. [2025-04-30 10:43:50,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 131 statements. [2025-04-30 10:43:50,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:43:50,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 161 proven. 13 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-04-30 10:43:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:50,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845282750] [2025-04-30 10:43:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845282750] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:50,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548523436] [2025-04-30 10:43:50,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:43:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:50,529 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:50,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:43:50,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 7 equivalence classes. [2025-04-30 10:43:51,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 131 statements. [2025-04-30 10:43:51,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:43:51,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:51,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:43:51,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:51,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 161 proven. 13 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-04-30 10:43:52,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:52,217 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:43:52,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-30 10:43:52,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2025-04-30 10:43:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-04-30 10:43:52,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548523436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:52,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:52,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2025-04-30 10:43:52,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165179030] [2025-04-30 10:43:52,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:52,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:43:52,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:52,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:43:52,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:43:52,490 INFO L87 Difference]: Start difference. First operand 177 states and 207 transitions. Second operand has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 26 states have internal predecessors, (116), 5 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-04-30 10:43:55,048 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:43:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:59,808 INFO L93 Difference]: Finished difference Result 170 states and 198 transitions. [2025-04-30 10:43:59,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:43:59,808 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 26 states have internal predecessors, (116), 5 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 131 [2025-04-30 10:43:59,808 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:59,809 INFO L225 Difference]: With dead ends: 170 [2025-04-30 10:43:59,809 INFO L226 Difference]: Without dead ends: 170 [2025-04-30 10:43:59,809 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=362, Invalid=1708, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:43:59,810 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 241 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:59,810 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 986 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 577 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2025-04-30 10:43:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-30 10:43:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-04-30 10:43:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.338235294117647) internal successors, (182), 158 states have internal predecessors, (182), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:43:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2025-04-30 10:43:59,815 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 131 [2025-04-30 10:43:59,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:59,815 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2025-04-30 10:43:59,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 26 states have internal predecessors, (116), 5 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-04-30 10:43:59,816 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2025-04-30 10:43:59,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-04-30 10:43:59,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:59,816 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:59,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:44:00,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:44:00,018 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:44:00,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1072721640, now seen corresponding path program 1 times [2025-04-30 10:44:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:00,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150333770] [2025-04-30 10:44:00,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:00,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-04-30 10:44:00,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:44:00,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:00,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 115 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-04-30 10:44:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150333770] [2025-04-30 10:44:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150333770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:00,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951117001] [2025-04-30 10:44:00,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:00,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:00,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:00,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:44:01,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-04-30 10:44:01,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:44:01,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:01,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:01,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-04-30 10:44:01,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:01,259 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:44:01,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 43 treesize of output 30 [2025-04-30 10:44:01,320 INFO L325 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2025-04-30 10:44:01,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 22 [2025-04-30 10:44:01,539 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:01,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 15 [2025-04-30 10:44:01,556 INFO L325 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2025-04-30 10:44:01,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 22 [2025-04-30 10:44:01,713 INFO L325 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-04-30 10:44:01,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-04-30 10:44:01,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-04-30 10:44:01,913 INFO L325 Elim1Store]: treesize reduction 74, result has 36.8 percent of original size [2025-04-30 10:44:01,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 49 [2025-04-30 10:44:01,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2025-04-30 10:44:02,117 INFO L325 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-04-30 10:44:02,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2025-04-30 10:44:02,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-04-30 10:44:02,332 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:02,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 25 [2025-04-30 10:44:02,357 INFO L325 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2025-04-30 10:44:02,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 43 [2025-04-30 10:44:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:44:02,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951117001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:02,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:02,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28] total 34 [2025-04-30 10:44:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351240900] [2025-04-30 10:44:02,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:02,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:44:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:02,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:44:02,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:44:02,495 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 35 states, 34 states have (on average 4.794117647058823) internal successors, (163), 33 states have internal predecessors, (163), 7 states have call successors, (7), 3 states have call predecessors, (7), 9 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2025-04-30 10:44:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,493 INFO L93 Difference]: Finished difference Result 207 states and 235 transitions. [2025-04-30 10:44:03,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:44:03,494 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.794117647058823) internal successors, (163), 33 states have internal predecessors, (163), 7 states have call successors, (7), 3 states have call predecessors, (7), 9 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 141 [2025-04-30 10:44:03,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,495 INFO L225 Difference]: With dead ends: 207 [2025-04-30 10:44:03,495 INFO L226 Difference]: Without dead ends: 207 [2025-04-30 10:44:03,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=2188, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:44:03,496 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 122 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:03,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 958 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:44:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-04-30 10:44:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 169. [2025-04-30 10:44:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 157 states have internal predecessors, (181), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2025-04-30 10:44:03,500 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 141 [2025-04-30 10:44:03,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,501 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2025-04-30 10:44:03,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.794117647058823) internal successors, (163), 33 states have internal predecessors, (163), 7 states have call successors, (7), 3 states have call predecessors, (7), 9 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2025-04-30 10:44:03,501 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2025-04-30 10:44:03,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-04-30 10:44:03,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,502 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:03,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:03,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:44:03,703 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-04-30 10:44:03,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1072721641, now seen corresponding path program 1 times [2025-04-30 10:44:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253369566] [2025-04-30 10:44:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-04-30 10:44:03,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:44:03,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-04-30 10:44:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:05,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253369566] [2025-04-30 10:44:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253369566] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:05,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57800213] [2025-04-30 10:44:05,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:05,060 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:05,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:44:05,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-04-30 10:44:05,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:44:05,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:05,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-04-30 10:44:05,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:05,501 WARN L871 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2025-04-30 10:44:05,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:05,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:44:05,602 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:44:05,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:44:05,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:44:05,774 INFO L325 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-04-30 10:44:05,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2025-04-30 10:44:05,792 INFO L325 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-04-30 10:44:05,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-04-30 10:44:05,982 WARN L871 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2025-04-30 10:44:06,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-30 10:44:06,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:06,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-04-30 10:44:06,028 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-30 10:44:06,028 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-30 10:44:06,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:44:06,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:44:06,198 INFO L325 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-04-30 10:44:06,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2025-04-30 10:44:06,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 54 treesize of output 23 [2025-04-30 10:44:06,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 42 treesize of output 11 [2025-04-30 10:44:06,589 INFO L325 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-04-30 10:44:06,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:44:06,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-04-30 10:44:06,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:44:06,960 INFO L325 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-04-30 10:44:06,960 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 37 [2025-04-30 10:44:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 45 proven. 186 refuted. 0 times theorem prover too weak. 4 trivial. 70 not checked. [2025-04-30 10:44:07,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57800213] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:07,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:44:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 32] total 42 [2025-04-30 10:44:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151573133] [2025-04-30 10:44:07,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:07,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:44:07,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:07,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:44:07,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1640, Unknown=2, NotChecked=166, Total=1980 [2025-04-30 10:44:07,242 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 43 states, 42 states have (on average 4.619047619047619) internal successors, (194), 39 states have internal predecessors, (194), 6 states have call successors, (6), 5 states have call predecessors, (6), 11 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Killed by 15