./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:15:44,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:15:44,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:15:44,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:15:44,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:15:44,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:15:44,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:15:44,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:15:44,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:15:44,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:15:44,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:15:44,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:15:44,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:15:44,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:15:44,322 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:15:44,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:15:44,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:15:44,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:15:44,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:15:44,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:15:44,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:15:44,328 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:15:44,329 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:15:44,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:15:44,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:15:44,329 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:15:44,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:15:44,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:15:44,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:15:44,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:15:44,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:15:44,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:15:44,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:15:44,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:15:44,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:15:44,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:15:44,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:15:44,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:15:44,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:15:44,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:15:44,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:15:44,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:15:44,334 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2024-10-11 18:15:44,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:15:44,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:15:44,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:15:44,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:15:44,607 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:15:44,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-10-11 18:15:46,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:15:46,287 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:15:46,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2024-10-11 18:15:46,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5f37915a/eb27841025df421db673c8b0e5b63c6e/FLAGa1fc9bb99 [2024-10-11 18:15:46,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5f37915a/eb27841025df421db673c8b0e5b63c6e [2024-10-11 18:15:46,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:15:46,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:15:46,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:15:46,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:15:46,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:15:46,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:46" (1/1) ... [2024-10-11 18:15:46,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf39e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:46, skipping insertion in model container [2024-10-11 18:15:46,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:46" (1/1) ... [2024-10-11 18:15:46,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:15:47,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:15:47,064 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:15:47,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:15:47,155 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:15:47,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47 WrapperNode [2024-10-11 18:15:47,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:15:47,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:15:47,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:15:47,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:15:47,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,218 INFO L138 Inliner]: procedures = 126, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-10-11 18:15:47,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:15:47,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:15:47,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:15:47,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:15:47,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,254 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 11, 9]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 11 writes are split as follows [0, 9, 2]. [2024-10-11 18:15:47,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:15:47,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:15:47,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:15:47,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:15:47,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (1/1) ... [2024-10-11 18:15:47,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:15:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:47,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:15:47,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:15:47,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:15:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:15:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:15:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:15:47,357 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:15:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:15:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:15:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:15:47,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:15:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:15:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:15:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:15:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:15:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:15:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:15:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:15:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:15:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:15:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:15:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:15:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:15:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:15:47,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:15:47,466 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:15:47,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:15:47,707 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-11 18:15:47,708 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:15:47,761 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:15:47,762 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 18:15:47,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:47 BoogieIcfgContainer [2024-10-11 18:15:47,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:15:47,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:15:47,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:15:47,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:15:47,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:15:46" (1/3) ... [2024-10-11 18:15:47,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ddc9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:47, skipping insertion in model container [2024-10-11 18:15:47,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:47" (2/3) ... [2024-10-11 18:15:47,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ddc9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:47, skipping insertion in model container [2024-10-11 18:15:47,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:47" (3/3) ... [2024-10-11 18:15:47,771 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2024-10-11 18:15:47,786 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:15:47,787 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-10-11 18:15:47,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:15:47,833 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1793eb0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:15:47,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-11 18:15:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 88 states have internal predecessors, (97), 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) [2024-10-11 18:15:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:15:47,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:47,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:15:47,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:47,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash 180097709, now seen corresponding path program 1 times [2024-10-11 18:15:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:47,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487722077] [2024-10-11 18:15:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487722077] [2024-10-11 18:15:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487722077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:15:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090995001] [2024-10-11 18:15:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:48,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:15:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:15:48,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:15:48,116 INFO L87 Difference]: Start difference. First operand has 92 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 88 states have internal predecessors, (97), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-10-11 18:15:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:48,224 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-10-11 18:15:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:15:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:15:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:48,235 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:15:48,236 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:15:48,237 INFO L431 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 [2024-10-11 18:15:48,242 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:48,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:15:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:15:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 40 states have (on average 2.15) internal successors, (86), 82 states have internal predecessors, (86), 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) [2024-10-11 18:15:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-10-11 18:15:48,277 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 5 [2024-10-11 18:15:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:48,278 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-10-11 18:15:48,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-10-11 18:15:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-10-11 18:15:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:15:48,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:48,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:15:48,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:15:48,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:48,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:48,280 INFO L85 PathProgramCache]: Analyzing trace with hash 180097710, now seen corresponding path program 1 times [2024-10-11 18:15:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:48,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574961117] [2024-10-11 18:15:48,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:48,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:48,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574961117] [2024-10-11 18:15:48,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574961117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:48,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:48,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:15:48,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759701257] [2024-10-11 18:15:48,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:48,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:15:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:15:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:15:48,413 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-10-11 18:15:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:48,497 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-11 18:15:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:15:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:15:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:48,498 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:15:48,499 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:15:48,499 INFO L431 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 [2024-10-11 18:15:48,500 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:48,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:15:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:15:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 40 states have (on average 2.075) internal successors, (83), 79 states have internal predecessors, (83), 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) [2024-10-11 18:15:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-10-11 18:15:48,507 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 5 [2024-10-11 18:15:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:48,507 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-10-11 18:15:48,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-10-11 18:15:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-10-11 18:15:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:15:48,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:48,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:48,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:15:48,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:48,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:48,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1003306652, now seen corresponding path program 1 times [2024-10-11 18:15:48,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:48,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909662094] [2024-10-11 18:15:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:48,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909662094] [2024-10-11 18:15:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909662094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:48,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:48,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:15:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819780434] [2024-10-11 18:15:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:48,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:15:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:48,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:15:48,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:15:48,671 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 18:15:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:48,779 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-10-11 18:15:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:15:48,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-10-11 18:15:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:48,781 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:15:48,782 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:15:48,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:15:48,783 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:48,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:15:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:15:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 2.048780487804878) internal successors, (84), 80 states have internal predecessors, (84), 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) [2024-10-11 18:15:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-10-11 18:15:48,795 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 11 [2024-10-11 18:15:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:48,796 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-10-11 18:15:48,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 18:15:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-10-11 18:15:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:15:48,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:48,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:48,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:15:48,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:48,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -905761605, now seen corresponding path program 1 times [2024-10-11 18:15:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:48,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134486244] [2024-10-11 18:15:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134486244] [2024-10-11 18:15:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134486244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:49,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:15:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834257377] [2024-10-11 18:15:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:49,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:49,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:49,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:49,047 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:49,260 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-11 18:15:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:49,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 18:15:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:49,262 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:15:49,262 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:15:49,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:49,263 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:49,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 234 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:15:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:15:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 41 states have (on average 2.024390243902439) internal successors, (83), 79 states have internal predecessors, (83), 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) [2024-10-11 18:15:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-10-11 18:15:49,274 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 19 [2024-10-11 18:15:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:49,275 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-10-11 18:15:49,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-10-11 18:15:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:15:49,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:49,277 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:49,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:15:49,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:49,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash -905761604, now seen corresponding path program 1 times [2024-10-11 18:15:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:49,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992804987] [2024-10-11 18:15:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992804987] [2024-10-11 18:15:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992804987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:15:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557084248] [2024-10-11 18:15:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:49,565 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:49,732 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-10-11 18:15:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:49,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 18:15:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:49,734 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:15:49,735 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:15:49,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:49,737 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:49,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:15:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 18:15:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.0) internal successors, (82), 78 states have internal predecessors, (82), 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) [2024-10-11 18:15:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-11 18:15:49,748 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 19 [2024-10-11 18:15:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:49,749 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-11 18:15:49,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-11 18:15:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:15:49,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:49,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:49,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:15:49,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:49,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:49,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1441458396, now seen corresponding path program 1 times [2024-10-11 18:15:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:49,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474781884] [2024-10-11 18:15:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:50,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:50,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474781884] [2024-10-11 18:15:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474781884] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68393587] [2024-10-11 18:15:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:50,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:50,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:50,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:50,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:15:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:50,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:15:50,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:50,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:50,245 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:15:50,303 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:15:50,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:15:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:15:50,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:50,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68393587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:50,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:50,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-11 18:15:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407640643] [2024-10-11 18:15:50,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:50,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:15:50,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:15:50,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:15:50,386 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:50,690 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-10-11 18:15:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:50,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 18:15:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:50,693 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:15:50,694 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:15:50,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:15:50,695 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:50,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2024-10-11 18:15:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:15:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 18:15:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-10-11 18:15:50,705 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 21 [2024-10-11 18:15:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-10-11 18:15:50,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-10-11 18:15:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:15:50,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:50,707 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:50,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:15:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:50,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1441458397, now seen corresponding path program 1 times [2024-10-11 18:15:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49763232] [2024-10-11 18:15:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:51,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:51,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49763232] [2024-10-11 18:15:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49763232] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:51,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277598556] [2024-10-11 18:15:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:51,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:51,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:51,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:51,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:15:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:51,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:15:51,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:51,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:15:51,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:51,685 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:15:51,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:15:51,702 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:51,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:15:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:51,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277598556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:51,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-11 18:15:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574643159] [2024-10-11 18:15:51,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:51,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:15:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:15:51,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:15:51,893 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:52,285 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-10-11 18:15:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:15:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-10-11 18:15:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:52,286 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:15:52,286 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:15:52,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-10-11 18:15:52,287 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:52,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 392 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:15:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:15:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 18:15:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-10-11 18:15:52,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 21 [2024-10-11 18:15:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:52,294 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-10-11 18:15:52,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-10-11 18:15:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:15:52,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:52,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:52,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:15:52,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:52,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:52,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2032763918, now seen corresponding path program 1 times [2024-10-11 18:15:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:52,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727807659] [2024-10-11 18:15:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:52,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:52,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727807659] [2024-10-11 18:15:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727807659] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584733124] [2024-10-11 18:15:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:52,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:52,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:52,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:52,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:15:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:15:52,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:52,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:52,883 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-11 18:15:52,904 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:15:52,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:15:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-11 18:15:52,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584733124] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:15:53,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:15:53,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2024-10-11 18:15:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189581753] [2024-10-11 18:15:53,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:53,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:15:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:15:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:15:53,075 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:15:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:53,340 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-10-11 18:15:53,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:53,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 23 [2024-10-11 18:15:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:53,342 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:15:53,342 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:15:53,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:15:53,343 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 10 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:53,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 482 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2024-10-11 18:15:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:15:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:15:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-10-11 18:15:53,347 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 23 [2024-10-11 18:15:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:53,348 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-10-11 18:15:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:15:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-10-11 18:15:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:15:53,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:53,349 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:53,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:15:53,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:53,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1404047320, now seen corresponding path program 1 times [2024-10-11 18:15:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957524629] [2024-10-11 18:15:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:53,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:53,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957524629] [2024-10-11 18:15:53,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957524629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:53,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381561847] [2024-10-11 18:15:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:53,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:53,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:53,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:15:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:15:53,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:53,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:53,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:15:54,040 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:15:54,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:54,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:15:54,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:54,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:15:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:15:54,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:54,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381561847] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:54,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:54,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 18:15:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154319668] [2024-10-11 18:15:54,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:54,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:15:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:54,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:15:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:15:54,194 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:54,477 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-10-11 18:15:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:15:54,477 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-11 18:15:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:54,479 INFO L225 Difference]: With dead ends: 103 [2024-10-11 18:15:54,479 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 18:15:54,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:15:54,480 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 24 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:54,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 481 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 439 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2024-10-11 18:15:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 18:15:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2024-10-11 18:15:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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) [2024-10-11 18:15:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-10-11 18:15:54,490 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 24 [2024-10-11 18:15:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:54,490 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-10-11 18:15:54,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-10-11 18:15:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:15:54,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:54,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:54,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 18:15:54,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:54,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 575793934, now seen corresponding path program 1 times [2024-10-11 18:15:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302540246] [2024-10-11 18:15:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:54,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302540246] [2024-10-11 18:15:54,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302540246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:54,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:54,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:15:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430977347] [2024-10-11 18:15:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:54,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:15:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:15:54,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:54,835 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:54,988 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-10-11 18:15:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-11 18:15:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:54,989 INFO L225 Difference]: With dead ends: 95 [2024-10-11 18:15:54,989 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 18:15:54,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:54,990 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:54,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 264 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 18:15:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 18:15:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 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) [2024-10-11 18:15:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-10-11 18:15:54,993 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 25 [2024-10-11 18:15:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:54,994 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-10-11 18:15:54,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-10-11 18:15:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:15:54,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:54,994 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:54,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:15:54,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 575793935, now seen corresponding path program 1 times [2024-10-11 18:15:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246985471] [2024-10-11 18:15:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246985471] [2024-10-11 18:15:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246985471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:55,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:55,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:15:55,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709486853] [2024-10-11 18:15:55,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:55,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:15:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:15:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:55,222 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:55,376 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-10-11 18:15:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:55,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-11 18:15:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:55,377 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:15:55,377 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 18:15:55,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:55,378 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 5 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:55,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 289 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 18:15:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 18:15:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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) [2024-10-11 18:15:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-10-11 18:15:55,385 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 25 [2024-10-11 18:15:55,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:55,386 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-10-11 18:15:55,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-10-11 18:15:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:15:55,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:55,386 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:55,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:15:55,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:55,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash -712691798, now seen corresponding path program 1 times [2024-10-11 18:15:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29593608] [2024-10-11 18:15:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:15:55,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29593608] [2024-10-11 18:15:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29593608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181460746] [2024-10-11 18:15:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:55,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:55,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:55,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:15:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:55,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:15:55,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:55,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:55,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:15:55,879 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:15:55,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:55,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:15:55,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:15:55,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:55,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:15:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:56,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:56,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181460746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:56,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:56,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2024-10-11 18:15:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716820423] [2024-10-11 18:15:56,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:56,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:15:56,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:56,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:15:56,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:15:56,054 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 14 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:56,445 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-10-11 18:15:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:15:56,445 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-10-11 18:15:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:56,446 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:15:56,446 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:15:56,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=211, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:15:56,447 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 203 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:56,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 227 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 462 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2024-10-11 18:15:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:15:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2024-10-11 18:15:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.736842105263158) internal successors, (99), 87 states have internal predecessors, (99), 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) [2024-10-11 18:15:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-10-11 18:15:56,452 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 27 [2024-10-11 18:15:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:56,452 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-10-11 18:15:56,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-10-11 18:15:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:15:56,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:56,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:56,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:56,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 18:15:56,655 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:56,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash -712691797, now seen corresponding path program 1 times [2024-10-11 18:15:56,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:56,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534565538] [2024-10-11 18:15:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:56,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:57,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:57,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534565538] [2024-10-11 18:15:57,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534565538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:57,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456088008] [2024-10-11 18:15:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:57,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:57,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:57,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:15:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:15:57,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:57,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:15:57,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:15:57,285 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-11 18:15:57,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:57,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:15:57,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:15:57,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:57,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:15:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:57,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456088008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:57,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2024-10-11 18:15:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934223947] [2024-10-11 18:15:57,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:15:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:57,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:15:57,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2024-10-11 18:15:57,528 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:15:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:57,689 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-10-11 18:15:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-11 18:15:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:57,690 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:15:57,690 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:15:57,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=184, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:15:57,691 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 176 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:57,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 143 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2024-10-11 18:15:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:15:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:15:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 79 states have internal predecessors, (89), 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) [2024-10-11 18:15:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-10-11 18:15:57,693 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 27 [2024-10-11 18:15:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:57,693 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-10-11 18:15:57,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:15:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-10-11 18:15:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:15:57,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:57,694 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:57,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:15:57,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:15:57,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:57,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash -618609235, now seen corresponding path program 1 times [2024-10-11 18:15:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767127618] [2024-10-11 18:15:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:58,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767127618] [2024-10-11 18:15:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767127618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:58,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:58,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:15:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646247044] [2024-10-11 18:15:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:58,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:15:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:58,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:15:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:15:58,071 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:58,301 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2024-10-11 18:15:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:15:58,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 18:15:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:58,302 INFO L225 Difference]: With dead ends: 113 [2024-10-11 18:15:58,302 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 18:15:58,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:15:58,302 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:58,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 265 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 18:15:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2024-10-11 18:15:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 80 states have internal predecessors, (91), 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) [2024-10-11 18:15:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-10-11 18:15:58,305 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 28 [2024-10-11 18:15:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:58,305 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-10-11 18:15:58,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-10-11 18:15:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:15:58,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:58,306 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:58,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:15:58,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:58,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash -618609234, now seen corresponding path program 1 times [2024-10-11 18:15:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093543015] [2024-10-11 18:15:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093543015] [2024-10-11 18:15:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093543015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:58,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:58,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:15:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490365061] [2024-10-11 18:15:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:58,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:15:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:15:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:15:58,627 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:58,861 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2024-10-11 18:15:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:15:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 18:15:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:58,862 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:15:58,862 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:15:58,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:15:58,862 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:58,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 332 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:15:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2024-10-11 18:15:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 80 states have internal predecessors, (90), 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) [2024-10-11 18:15:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-11 18:15:58,867 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2024-10-11 18:15:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:58,867 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-11 18:15:58,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-11 18:15:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:15:58,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:58,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:15:58,870 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:58,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1997018926, now seen corresponding path program 1 times [2024-10-11 18:15:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81681951] [2024-10-11 18:15:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:15:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81681951] [2024-10-11 18:15:58,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81681951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:58,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:58,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:15:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79491498] [2024-10-11 18:15:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:58,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:15:58,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:15:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:15:58,949 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:59,031 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2024-10-11 18:15:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:15:59,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-10-11 18:15:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:59,032 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:15:59,032 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:15:59,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:15:59,033 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 111 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:59,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 138 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:15:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2024-10-11 18:15:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.543859649122807) internal successors, (88), 79 states have internal predecessors, (88), 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) [2024-10-11 18:15:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-10-11 18:15:59,037 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 29 [2024-10-11 18:15:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:59,037 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-10-11 18:15:59,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-10-11 18:15:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:15:59,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:59,038 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:15:59,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:15:59,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:59,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash 850195118, now seen corresponding path program 1 times [2024-10-11 18:15:59,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:59,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008122445] [2024-10-11 18:15:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:15:59,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:59,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008122445] [2024-10-11 18:15:59,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008122445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:59,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:59,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:15:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889471134] [2024-10-11 18:15:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:15:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:59,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:15:59,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:15:59,125 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:59,215 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-10-11 18:15:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:15:59,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 18:15:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:59,216 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:15:59,217 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:15:59,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:59,217 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:59,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:15:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:15:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 78 states have internal predecessors, (87), 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) [2024-10-11 18:15:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-10-11 18:15:59,219 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 32 [2024-10-11 18:15:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:59,220 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-11 18:15:59,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-10-11 18:15:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:15:59,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:59,220 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:15:59,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:15:59,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:59,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 850195119, now seen corresponding path program 1 times [2024-10-11 18:15:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127566579] [2024-10-11 18:15:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:59,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:59,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127566579] [2024-10-11 18:15:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127566579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:59,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:59,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:15:59,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709916488] [2024-10-11 18:15:59,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:59,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:15:59,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:59,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:15:59,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:15:59,582 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:59,870 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-10-11 18:15:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:15:59,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 18:15:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:59,871 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:15:59,871 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:15:59,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:15:59,872 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:59,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 353 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:15:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2024-10-11 18:15:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 82 states have internal predecessors, (92), 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) [2024-10-11 18:15:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-10-11 18:15:59,875 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 32 [2024-10-11 18:15:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:59,875 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-10-11 18:15:59,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:15:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-10-11 18:15:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:15:59,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:59,876 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:15:59,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:15:59,876 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:15:59,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash 850181215, now seen corresponding path program 1 times [2024-10-11 18:15:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:59,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881118170] [2024-10-11 18:15:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:00,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881118170] [2024-10-11 18:16:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881118170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:00,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:00,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207382343] [2024-10-11 18:16:00,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:00,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:00,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:00,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:00,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:00,088 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:00,312 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2024-10-11 18:16:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:16:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 18:16:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:00,313 INFO L225 Difference]: With dead ends: 124 [2024-10-11 18:16:00,314 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 18:16:00,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:16:00,314 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:00,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 379 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 18:16:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2024-10-11 18:16:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 93 states have internal predecessors, (111), 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) [2024-10-11 18:16:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2024-10-11 18:16:00,317 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 32 [2024-10-11 18:16:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-10-11 18:16:00,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2024-10-11 18:16:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:16:00,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:00,318 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:00,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:16:00,318 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:00,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash 586247323, now seen corresponding path program 1 times [2024-10-11 18:16:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350249003] [2024-10-11 18:16:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:01,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:01,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350249003] [2024-10-11 18:16:01,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350249003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:01,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147347194] [2024-10-11 18:16:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:01,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:01,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:01,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:01,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:16:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 18:16:01,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:01,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:01,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:01,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:01,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:01,644 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:16:01,645 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-10-11 18:16:01,736 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:16:01,736 INFO L378 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-10-11 18:16:01,783 INFO L378 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 57 treesize of output 36 [2024-10-11 18:16:01,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2024-10-11 18:16:01,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:01,935 INFO L378 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 1 case distinctions, treesize of input 36 treesize of output 16 [2024-10-11 18:16:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:01,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:01,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-10-11 18:16:01,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-11 18:16:01,993 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-11 18:16:01,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:16:01,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2162 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2162) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2024-10-11 18:16:02,009 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2162) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2024-10-11 18:16:02,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2161) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2162) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2024-10-11 18:16:02,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:02,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-11 18:16:02,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-10-11 18:16:02,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-11 18:16:02,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-10-11 18:16:02,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147347194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:02,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2024-10-11 18:16:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006842964] [2024-10-11 18:16:02,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:02,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 18:16:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 18:16:02,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1157, Unknown=3, NotChecked=210, Total=1482 [2024-10-11 18:16:02,168 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 32 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:02,862 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-10-11 18:16:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:16:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-10-11 18:16:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:02,863 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:16:02,863 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:16:02,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1580, Unknown=3, NotChecked=246, Total=1980 [2024-10-11 18:16:02,865 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 121 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:02,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 572 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:16:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:16:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2024-10-11 18:16:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.5) internal successors, (123), 103 states have internal predecessors, (123), 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) [2024-10-11 18:16:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2024-10-11 18:16:02,868 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 33 [2024-10-11 18:16:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:02,869 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2024-10-11 18:16:02,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2024-10-11 18:16:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:16:02,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:02,870 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:02,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:16:03,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:03,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:03,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash 586247324, now seen corresponding path program 1 times [2024-10-11 18:16:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:03,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939471774] [2024-10-11 18:16:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:03,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939471774] [2024-10-11 18:16:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939471774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861594900] [2024-10-11 18:16:03,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:03,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:03,937 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:03,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:16:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:04,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-10-11 18:16:04,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:04,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2024-10-11 18:16:04,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:16:04,402 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:04,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:04,414 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2024-10-11 18:16:04,416 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from true [2024-10-11 18:16:04,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:04,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:04,582 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:16:04,582 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-10-11 18:16:04,589 INFO L378 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 24 treesize of output 11 [2024-10-11 18:16:04,701 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:16:04,701 INFO L378 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:16:04,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:04,710 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:04,729 INFO L378 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 57 treesize of output 36 [2024-10-11 18:16:04,738 INFO L378 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 39 treesize of output 15 [2024-10-11 18:16:04,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:16:04,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:04,914 INFO L378 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 1 case distinctions, treesize of input 60 treesize of output 20 [2024-10-11 18:16:04,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:16:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:04,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:05,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 72 [2024-10-11 18:16:05,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2024-10-11 18:16:05,186 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2344 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2344 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2024-10-11 18:16:05,200 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2344 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_2344 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-10-11 18:16:05,211 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2342 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2342) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2342 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2342) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2344) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2343) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-10-11 18:16:05,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:05,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-11 18:16:05,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2024-10-11 18:16:05,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-10-11 18:16:05,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-11 18:16:05,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:05,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2024-10-11 18:16:05,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:05,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-11 18:16:05,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:05,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:05,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 22 [2024-10-11 18:16:05,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:05,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:05,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2024-10-11 18:16:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861594900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:05,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2024-10-11 18:16:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641703285] [2024-10-11 18:16:05,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:05,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 18:16:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 18:16:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1691, Unknown=5, NotChecked=340, Total=2162 [2024-10-11 18:16:05,454 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 36 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 30 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:05,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 12) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 .cse0)))) is different from false [2024-10-11 18:16:05,686 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 12) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (< 11 .cse0)))) is different from true [2024-10-11 18:16:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:06,637 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2024-10-11 18:16:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:16:06,637 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 30 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-10-11 18:16:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:06,638 INFO L225 Difference]: With dead ends: 129 [2024-10-11 18:16:06,638 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 18:16:06,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=262, Invalid=3057, Unknown=7, NotChecked=580, Total=3906 [2024-10-11 18:16:06,639 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 190 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:06,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 689 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1175 Invalid, 0 Unknown, 143 Unchecked, 0.5s Time] [2024-10-11 18:16:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 18:16:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2024-10-11 18:16:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 103 states have internal predecessors, (122), 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) [2024-10-11 18:16:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2024-10-11 18:16:06,642 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 33 [2024-10-11 18:16:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2024-10-11 18:16:06,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 30 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2024-10-11 18:16:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:16:06,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:06,642 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:06,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:16:06,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:16:06,843 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 585813988, now seen corresponding path program 1 times [2024-10-11 18:16:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780889847] [2024-10-11 18:16:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:07,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:07,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780889847] [2024-10-11 18:16:07,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780889847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:07,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:07,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:07,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878656590] [2024-10-11 18:16:07,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:07,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:07,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:07,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:07,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:07,029 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:07,269 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2024-10-11 18:16:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:16:07,269 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-10-11 18:16:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:07,269 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:16:07,269 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:16:07,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:16:07,270 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 58 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:07,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 331 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:16:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2024-10-11 18:16:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 106 states have internal predecessors, (125), 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) [2024-10-11 18:16:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2024-10-11 18:16:07,273 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 33 [2024-10-11 18:16:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:07,273 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-10-11 18:16:07,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2024-10-11 18:16:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:16:07,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:07,274 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:07,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:16:07,274 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:07,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash -27589745, now seen corresponding path program 1 times [2024-10-11 18:16:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:07,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652346866] [2024-10-11 18:16:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 18:16:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 18:16:07,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652346866] [2024-10-11 18:16:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652346866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:07,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:16:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938976191] [2024-10-11 18:16:07,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:07,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:16:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:16:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:07,392 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:07,456 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-10-11 18:16:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:16:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-11 18:16:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:07,457 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:16:07,457 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:16:07,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:16:07,459 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:07,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:16:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:16:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 81 states have internal predecessors, (92), 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) [2024-10-11 18:16:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-10-11 18:16:07,462 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 34 [2024-10-11 18:16:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:07,462 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-10-11 18:16:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-10-11 18:16:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:16:07,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:07,463 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:07,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:16:07,463 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 993797886, now seen corresponding path program 1 times [2024-10-11 18:16:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711770908] [2024-10-11 18:16:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711770908] [2024-10-11 18:16:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711770908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:07,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:07,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:16:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763651201] [2024-10-11 18:16:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:07,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:16:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:07,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:16:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:16:07,901 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:08,161 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-10-11 18:16:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:16:08,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-11 18:16:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:08,162 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:16:08,162 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:16:08,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:16:08,164 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:08,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 348 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:16:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-10-11 18:16:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.46875) internal successors, (94), 82 states have internal predecessors, (94), 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) [2024-10-11 18:16:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-11 18:16:08,166 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 34 [2024-10-11 18:16:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:08,167 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-11 18:16:08,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-11 18:16:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:16:08,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:08,167 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:08,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:16:08,168 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:08,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash 993797887, now seen corresponding path program 1 times [2024-10-11 18:16:08,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:08,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109392806] [2024-10-11 18:16:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:08,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:16:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:08,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109392806] [2024-10-11 18:16:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109392806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:08,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173778547] [2024-10-11 18:16:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:08,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:08,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:08,854 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:16:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:09,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-11 18:16:09,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:09,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:16:09,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:09,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:09,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:09,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:16:09,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-11 18:16:09,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 18:16:09,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2024-10-11 18:16:09,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:16:09,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 18:16:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:09,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:09,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:09,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:09,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:09,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:09,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:16:09,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:16:10,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173778547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:10,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:10,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2024-10-11 18:16:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959640569] [2024-10-11 18:16:10,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:10,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:16:10,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:10,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:16:10,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 18:16:10,099 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 30 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:10,797 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-10-11 18:16:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:16:10,797 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2024-10-11 18:16:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:10,798 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:16:10,798 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:16:10,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=2131, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 18:16:10,799 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 134 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:10,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 540 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:16:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:16:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2024-10-11 18:16:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.453125) internal successors, (93), 82 states have internal predecessors, (93), 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) [2024-10-11 18:16:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-10-11 18:16:10,805 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 34 [2024-10-11 18:16:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:10,805 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-10-11 18:16:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-10-11 18:16:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:16:10,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:10,805 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:10,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:11,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:11,007 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash 980364545, now seen corresponding path program 1 times [2024-10-11 18:16:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942476537] [2024-10-11 18:16:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942476537] [2024-10-11 18:16:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942476537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:11,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:16:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959173349] [2024-10-11 18:16:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:11,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:16:11,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:11,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:16:11,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:16:11,120 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:11,226 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-10-11 18:16:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:16:11,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-11 18:16:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:11,227 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:16:11,227 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:16:11,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:16:11,228 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:11,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 133 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:16:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:16:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.421875) internal successors, (91), 81 states have internal predecessors, (91), 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) [2024-10-11 18:16:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-10-11 18:16:11,232 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 34 [2024-10-11 18:16:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:11,233 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-10-11 18:16:11,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-10-11 18:16:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:16:11,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:11,233 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:11,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:16:11,233 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:11,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash 326529927, now seen corresponding path program 1 times [2024-10-11 18:16:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:11,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846314261] [2024-10-11 18:16:11,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:11,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846314261] [2024-10-11 18:16:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846314261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123001941] [2024-10-11 18:16:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:11,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:11,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:11,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:11,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:16:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:11,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:16:11,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:11,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:11,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:16:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:11,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:16:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123001941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:16:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-10-11 18:16:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807907523] [2024-10-11 18:16:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:16:11,803 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:11,902 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-10-11 18:16:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:16:11,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-10-11 18:16:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:11,903 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:16:11,903 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:16:11,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:16:11,904 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 104 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:11,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:16:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:16:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.390625) internal successors, (89), 80 states have internal predecessors, (89), 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) [2024-10-11 18:16:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-10-11 18:16:11,906 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 35 [2024-10-11 18:16:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:11,906 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-10-11 18:16:11,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-10-11 18:16:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:16:11,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:11,906 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:11,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:16:12,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:16:12,110 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:12,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1557030656, now seen corresponding path program 1 times [2024-10-11 18:16:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:12,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657429765] [2024-10-11 18:16:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:12,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657429765] [2024-10-11 18:16:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657429765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719703744] [2024-10-11 18:16:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:12,389 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:12,530 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2024-10-11 18:16:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:16:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-11 18:16:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:12,531 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:16:12,531 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 18:16:12,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:16:12,532 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:12,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 328 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 18:16:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2024-10-11 18:16:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 86 states have internal predecessors, (100), 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) [2024-10-11 18:16:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-10-11 18:16:12,534 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 36 [2024-10-11 18:16:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:12,534 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-10-11 18:16:12,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2024-10-11 18:16:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:16:12,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:12,534 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:12,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:16:12,535 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:12,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1023310206, now seen corresponding path program 1 times [2024-10-11 18:16:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344685374] [2024-10-11 18:16:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:12,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344685374] [2024-10-11 18:16:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344685374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:12,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:16:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004574525] [2024-10-11 18:16:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:12,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:16:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:16:12,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:16:12,736 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:12,937 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2024-10-11 18:16:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:16:12,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-11 18:16:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:12,938 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:16:12,938 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:16:12,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:16:12,938 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:12,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 291 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:16:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:16:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-10-11 18:16:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 89 states have internal predecessors, (103), 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) [2024-10-11 18:16:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-10-11 18:16:12,940 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 37 [2024-10-11 18:16:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:12,941 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-10-11 18:16:12,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-10-11 18:16:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:16:12,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:12,941 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:12,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 18:16:12,945 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:12,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1657845442, now seen corresponding path program 1 times [2024-10-11 18:16:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:12,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609951713] [2024-10-11 18:16:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:12,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609951713] [2024-10-11 18:16:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609951713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:13,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:16:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086911914] [2024-10-11 18:16:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:16:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:16:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:16:13,057 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:13,163 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-10-11 18:16:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:16:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-10-11 18:16:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:13,165 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:16:13,165 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:16:13,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:16:13,166 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:13,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 132 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:16:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:16:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 88 states have internal predecessors, (102), 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) [2024-10-11 18:16:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-10-11 18:16:13,170 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 38 [2024-10-11 18:16:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:13,170 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-10-11 18:16:13,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-10-11 18:16:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:16:13,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:13,171 INFO L215 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] [2024-10-11 18:16:13,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 18:16:13,172 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:13,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash -447798460, now seen corresponding path program 1 times [2024-10-11 18:16:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:13,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287097082] [2024-10-11 18:16:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:13,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287097082] [2024-10-11 18:16:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287097082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:13,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215910703] [2024-10-11 18:16:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:13,282 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:13,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:16:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:13,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:16:13,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:13,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:13,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:16:13,586 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:16:13,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:13,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:16:13,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:16:13,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:13,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:16:13,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:16:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:13,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215910703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:13,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2024-10-11 18:16:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094860536] [2024-10-11 18:16:13,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:13,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:16:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:13,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:16:13,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=85, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:16:13,902 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:14,029 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2024-10-11 18:16:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:16:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-11 18:16:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:14,030 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:16:14,030 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 18:16:14,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=133, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:16:14,031 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 167 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:14,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 98 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2024-10-11 18:16:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 18:16:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2024-10-11 18:16:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.356164383561644) internal successors, (99), 86 states have internal predecessors, (99), 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) [2024-10-11 18:16:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-10-11 18:16:14,034 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 38 [2024-10-11 18:16:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:14,035 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-10-11 18:16:14,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-10-11 18:16:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:16:14,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:14,035 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 18:16:14,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:14,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-11 18:16:14,236 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash -146398719, now seen corresponding path program 1 times [2024-10-11 18:16:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876462594] [2024-10-11 18:16:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:14,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:14,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876462594] [2024-10-11 18:16:14,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876462594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:14,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572532763] [2024-10-11 18:16:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:14,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:14,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:14,517 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:14,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:16:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:14,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:16:14,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:14,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:14,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:16:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:14,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:16:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572532763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:14,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:16:14,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-10-11 18:16:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100986061] [2024-10-11 18:16:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:14,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:14,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:14,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:16:14,818 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:14,896 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-10-11 18:16:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:16:14,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-10-11 18:16:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:14,897 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:16:14,897 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:16:14,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:16:14,898 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 86 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:14,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 76 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:16:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 18:16:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 85 states have internal predecessors, (98), 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) [2024-10-11 18:16:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2024-10-11 18:16:14,900 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 39 [2024-10-11 18:16:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:14,900 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2024-10-11 18:16:14,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2024-10-11 18:16:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:16:14,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:14,900 INFO L215 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] [2024-10-11 18:16:14,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:16:15,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:15,101 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:15,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash -996850349, now seen corresponding path program 1 times [2024-10-11 18:16:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:15,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965391896] [2024-10-11 18:16:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:15,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965391896] [2024-10-11 18:16:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965391896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745318503] [2024-10-11 18:16:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:15,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:15,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:15,754 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:15,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:16:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:16,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-11 18:16:16,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:16,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:16,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:16,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:16,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:16,184 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:16:16,184 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-10-11 18:16:16,244 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:16:16,245 INFO L378 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-10-11 18:16:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:16,253 INFO L378 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 46 treesize of output 33 [2024-10-11 18:16:16,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:16,404 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-11 18:16:16,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 55 treesize of output 41 [2024-10-11 18:16:16,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 18:16:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:16,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:16,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:16:16,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-10-11 18:16:16,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4126 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4126) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2024-10-11 18:16:16,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4125 (Array Int Int)) (v_ArrVal_4126 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4125) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4126) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_37| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-10-11 18:16:16,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:16,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-10-11 18:16:16,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2024-10-11 18:16:16,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2024-10-11 18:16:16,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:16,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2024-10-11 18:16:16,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2024-10-11 18:16:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:17,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745318503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:17,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:17,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 48 [2024-10-11 18:16:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614244528] [2024-10-11 18:16:17,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:17,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 18:16:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:17,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 18:16:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1919, Unknown=10, NotChecked=178, Total=2256 [2024-10-11 18:16:17,221 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 48 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 41 states have internal predecessors, (79), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:18,154 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-10-11 18:16:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:16:18,154 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 41 states have internal predecessors, (79), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2024-10-11 18:16:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:18,155 INFO L225 Difference]: With dead ends: 73 [2024-10-11 18:16:18,155 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 18:16:18,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=240, Invalid=2728, Unknown=10, NotChecked=214, Total=3192 [2024-10-11 18:16:18,156 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:18,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 989 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1147 Invalid, 0 Unknown, 75 Unchecked, 0.6s Time] [2024-10-11 18:16:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 18:16:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-11 18:16:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 65 states have internal predecessors, (67), 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) [2024-10-11 18:16:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2024-10-11 18:16:18,159 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 39 [2024-10-11 18:16:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:18,159 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2024-10-11 18:16:18,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 41 states have internal predecessors, (79), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2024-10-11 18:16:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:16:18,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:18,160 INFO L215 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] [2024-10-11 18:16:18,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:18,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:18,361 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:18,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -956377077, now seen corresponding path program 1 times [2024-10-11 18:16:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:18,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362854702] [2024-10-11 18:16:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:18,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362854702] [2024-10-11 18:16:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362854702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095356858] [2024-10-11 18:16:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:19,439 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:19,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:16:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:19,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-11 18:16:19,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:19,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:19,778 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:19,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:19,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:19,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:19,859 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:19,862 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:19,926 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:19,930 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:19,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:19,971 INFO L378 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 59 treesize of output 38 [2024-10-11 18:16:19,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:19,976 INFO L378 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 43 treesize of output 15 [2024-10-11 18:16:20,172 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-11 18:16:20,173 INFO L378 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 27 treesize of output 19 [2024-10-11 18:16:20,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:20,198 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-11 18:16:20,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 70 treesize of output 46 [2024-10-11 18:16:20,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-10-11 18:16:20,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:20,641 INFO L378 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 22 treesize of output 9 [2024-10-11 18:16:20,683 INFO L378 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 28 treesize of output 8 [2024-10-11 18:16:20,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:16:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:20,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:21,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:16:21,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2024-10-11 18:16:21,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:21,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2024-10-11 18:16:21,431 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| Int) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4348 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| 4))) (or (= (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4346) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 v_ArrVal_4348) 0) 0) (forall ((v_ArrVal_4345 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| Int) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4348 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| 4))) (or (= (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4346) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_4348) 0) 0) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_4345 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| Int)) (or (forall ((v_ArrVal_4345 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= (select .cse2 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse2 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-10-11 18:16:21,467 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4343 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| Int) (v_ArrVal_4344 (Array Int Int)) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4348 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| 4))) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4344) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4346) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 v_ArrVal_4348) 0) 0) (forall ((v_ArrVal_4345 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4343) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_4343 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| Int) (v_ArrVal_4344 (Array Int Int)) (v_ArrVal_4346 (Array Int Int)) (v_ArrVal_4348 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| 4))) (or (forall ((v_ArrVal_4345 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4343) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4344) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4346) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_4348) 0) 0)))) (forall ((v_ArrVal_4343 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| Int)) (or (forall ((v_ArrVal_4345 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4343) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4345) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= (select .cse2 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store .cse2 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-10-11 18:16:21,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:21,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2024-10-11 18:16:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 125 [2024-10-11 18:16:21,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:21,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 77 [2024-10-11 18:16:21,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 124 [2024-10-11 18:16:21,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2024-10-11 18:16:21,641 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:16:21,645 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 18:16:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095356858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:21,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:21,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 43 [2024-10-11 18:16:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990848662] [2024-10-11 18:16:21,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:21,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 18:16:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 18:16:21,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3088, Unknown=12, NotChecked=226, Total=3540 [2024-10-11 18:16:21,786 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 44 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 40 states have internal predecessors, (65), 2 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) [2024-10-11 18:16:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:22,743 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-10-11 18:16:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 18:16:22,744 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 40 states have internal predecessors, (65), 2 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 [2024-10-11 18:16:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:22,744 INFO L225 Difference]: With dead ends: 100 [2024-10-11 18:16:22,744 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 18:16:22,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=393, Invalid=4715, Unknown=12, NotChecked=282, Total=5402 [2024-10-11 18:16:22,746 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 97 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:22,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 508 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:16:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 18:16:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 75. [2024-10-11 18:16:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.271186440677966) internal successors, (75), 71 states have internal predecessors, (75), 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) [2024-10-11 18:16:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-10-11 18:16:22,748 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 43 [2024-10-11 18:16:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:22,748 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-10-11 18:16:22,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 40 states have internal predecessors, (65), 2 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) [2024-10-11 18:16:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-10-11 18:16:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:16:22,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:22,749 INFO L215 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] [2024-10-11 18:16:22,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:22,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 18:16:22,950 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:22,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash -956377076, now seen corresponding path program 1 times [2024-10-11 18:16:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945528449] [2024-10-11 18:16:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:24,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:24,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945528449] [2024-10-11 18:16:24,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945528449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:24,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174944681] [2024-10-11 18:16:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:24,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:24,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:24,088 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:24,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:16:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:24,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-10-11 18:16:24,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:24,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:16:24,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:24,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:24,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:24,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:16:24,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:24,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:24,739 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:16:24,739 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-10-11 18:16:24,748 INFO L378 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 24 treesize of output 11 [2024-10-11 18:16:24,839 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:16:24,839 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:16:24,852 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:16:24,853 INFO L378 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:16:24,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:24,894 INFO L378 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 59 treesize of output 38 [2024-10-11 18:16:24,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:24,900 INFO L378 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 43 treesize of output 15 [2024-10-11 18:16:25,115 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-11 18:16:25,116 INFO L378 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 27 treesize of output 19 [2024-10-11 18:16:25,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:25,141 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-11 18:16:25,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 70 treesize of output 46 [2024-10-11 18:16:25,480 INFO L378 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 28 treesize of output 8 [2024-10-11 18:16:25,483 INFO L378 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 19 treesize of output 11 [2024-10-11 18:16:25,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:16:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:25,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:26,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:26,027 INFO L378 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 130 treesize of output 129 [2024-10-11 18:16:26,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2024-10-11 18:16:26,369 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_42| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_prenex_6 Int) (v_ArrVal_4572 (Array Int Int)) (v_ArrVal_4573 (Array Int Int))) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_42| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4573) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 v_prenex_6) 0) 4) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4572) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_42| Int)) (or (forall ((v_ArrVal_4573 (Array Int Int)) (v_ArrVal_4574 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4573) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_42| 4) v_ArrVal_4574) 0))) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-10-11 18:16:26,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:26,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-10-11 18:16:26,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:26,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-10-11 18:16:26,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 152 [2024-10-11 18:16:26,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 492 [2024-10-11 18:16:26,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:26,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 91 [2024-10-11 18:16:26,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:26,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2024-10-11 18:16:26,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 163 [2024-10-11 18:16:26,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2024-10-11 18:16:26,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 191 [2024-10-11 18:16:26,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2024-10-11 18:16:26,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:26,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-11 18:16:26,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:26,856 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:26,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 19 [2024-10-11 18:16:26,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:26,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 18:16:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174944681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:27,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2024-10-11 18:16:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015138654] [2024-10-11 18:16:27,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:27,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 18:16:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 18:16:27,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3298, Unknown=62, NotChecked=116, Total=3660 [2024-10-11 18:16:27,068 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 45 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:28,627 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-10-11 18:16:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:16:28,628 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-10-11 18:16:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:28,628 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:16:28,628 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:16:28,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=310, Invalid=5177, Unknown=67, NotChecked=146, Total=5700 [2024-10-11 18:16:28,630 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 125 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:28,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 828 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:16:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:16:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2024-10-11 18:16:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 71 states have internal predecessors, (74), 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) [2024-10-11 18:16:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-10-11 18:16:28,632 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2024-10-11 18:16:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:28,632 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-10-11 18:16:28,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-10-11 18:16:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:16:28,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:28,633 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-11 18:16:28,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 18:16:28,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 18:16:28,834 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:28,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash 417079860, now seen corresponding path program 1 times [2024-10-11 18:16:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520410032] [2024-10-11 18:16:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:28,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520410032] [2024-10-11 18:16:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520410032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290423232] [2024-10-11 18:16:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:28,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:28,923 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:28,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:16:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:16:29,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:29,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290423232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:16:29,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:16:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 18:16:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094549658] [2024-10-11 18:16:29,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:16:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:16:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:16:29,275 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:29,349 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2024-10-11 18:16:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:29,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-11 18:16:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:29,350 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:16:29,350 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:16:29,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:16:29,351 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 121 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:29,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 223 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:16:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2024-10-11 18:16:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 71 states have internal predecessors, (73), 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) [2024-10-11 18:16:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-10-11 18:16:29,353 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 44 [2024-10-11 18:16:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:29,353 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-10-11 18:16:29,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-10-11 18:16:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 18:16:29,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:29,354 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-11 18:16:29,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 18:16:29,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-11 18:16:29,555 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:29,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash 39757325, now seen corresponding path program 1 times [2024-10-11 18:16:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479447671] [2024-10-11 18:16:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479447671] [2024-10-11 18:16:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479447671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934991559] [2024-10-11 18:16:29,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:29,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:29,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:29,822 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:29,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:16:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:30,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-10-11 18:16:30,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:30,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:30,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:30,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:30,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:30,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:30,327 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:30,335 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:30,394 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:30,397 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:30,405 INFO L378 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 31 treesize of output 26 [2024-10-11 18:16:30,409 INFO L378 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 44 treesize of output 31 [2024-10-11 18:16:30,690 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2024-10-11 18:16:30,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2024-10-11 18:16:30,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:30,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:30,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 63 [2024-10-11 18:16:30,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:30,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:31,373 INFO L378 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 19 [2024-10-11 18:16:31,381 INFO L378 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 28 treesize of output 8 [2024-10-11 18:16:31,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:31,489 INFO L378 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 31 treesize of output 23 [2024-10-11 18:16:31,498 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-10-11 18:16:31,498 INFO L378 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 42 treesize of output 17 [2024-10-11 18:16:31,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:16:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:31,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:31,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2024-10-11 18:16:31,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:31,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:32,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:32,416 INFO L378 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 244 treesize of output 227 [2024-10-11 18:16:32,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 141 [2024-10-11 18:16:32,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_5013 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) 0) 0)) (forall ((v_ArrVal_5014 (Array Int Int))) (let ((.cse1 (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5014) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))) (forall ((v_ArrVal_5013 (Array Int Int))) (let ((.cse3 (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse2 (select .cse3 0))) (or (< .cse2 0) (< .cse2 (+ (select .cse3 4) 1)))))) (forall ((v_ArrVal_5013 (Array Int Int))) (let ((.cse4 (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (or (< (select .cse4 0) 0) (< (select .cse4 4) 1)))))) is different from false [2024-10-11 18:16:32,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_5011 (Array Int Int)) (v_ArrVal_5014 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5011) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5014) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 4) (select .cse0 0)))) (forall ((v_ArrVal_5013 (Array Int Int)) (v_ArrVal_5012 (Array Int Int))) (< (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5012) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) 0) 0))) (forall ((v_ArrVal_5013 (Array Int Int)) (v_ArrVal_5012 (Array Int Int))) (let ((.cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5012) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (or (< (select .cse2 0) 0) (< (select .cse2 4) 1)))) (forall ((v_ArrVal_5013 (Array Int Int)) (v_ArrVal_5012 (Array Int Int))) (let ((.cse4 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5012) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse3 (select .cse4 0))) (or (< .cse3 0) (< .cse3 (+ (select .cse4 4) 1)))))))) is different from false [2024-10-11 18:16:32,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:32,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-11 18:16:32,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2024-10-11 18:16:32,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-10-11 18:16:32,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2024-10-11 18:16:32,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:32,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2024-10-11 18:16:33,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:33,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2024-10-11 18:16:33,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2024-10-11 18:16:33,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 81 treesize of output 73 [2024-10-11 18:16:33,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 188 treesize of output 172 [2024-10-11 18:16:33,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:33,161 INFO L378 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 109 treesize of output 115 [2024-10-11 18:16:33,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:33,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 62 [2024-10-11 18:16:33,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 181 [2024-10-11 18:16:33,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 138 treesize of output 128 [2024-10-11 18:16:33,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 305 treesize of output 285 [2024-10-11 18:16:33,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:33,370 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:33,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 162 [2024-10-11 18:16:33,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:33,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2024-10-11 18:16:33,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 305 [2024-10-11 18:16:33,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 117 treesize of output 109 [2024-10-11 18:16:33,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:33,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:33,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 63 [2024-10-11 18:16:33,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 49 [2024-10-11 18:16:33,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934991559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:33,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:33,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 28] total 36 [2024-10-11 18:16:33,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434319981] [2024-10-11 18:16:33,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:33,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 18:16:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:33,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 18:16:33,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2779, Unknown=29, NotChecked=214, Total=3192 [2024-10-11 18:16:33,786 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 36 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 32 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:35,509 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2024-10-11 18:16:35,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 18:16:35,510 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 32 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-10-11 18:16:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:35,510 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:16:35,510 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:16:35,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=457, Invalid=5679, Unknown=34, NotChecked=310, Total=6480 [2024-10-11 18:16:35,512 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 181 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:35,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 716 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:16:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:16:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 85. [2024-10-11 18:16:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 81 states have internal predecessors, (87), 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) [2024-10-11 18:16:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-10-11 18:16:35,514 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 47 [2024-10-11 18:16:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:35,514 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-10-11 18:16:35,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 32 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:16:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-10-11 18:16:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 18:16:35,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:35,515 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-11 18:16:35,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:35,715 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:35,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash 39743421, now seen corresponding path program 1 times [2024-10-11 18:16:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368352597] [2024-10-11 18:16:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:36,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:36,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368352597] [2024-10-11 18:16:36,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368352597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:36,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448404046] [2024-10-11 18:16:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:36,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:36,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:36,452 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 18:16:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:36,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-11 18:16:36,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:36,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:36,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:36,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:36,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:16:36,938 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:36,994 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:37,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:37,001 INFO L378 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 43 treesize of output 15 [2024-10-11 18:16:37,092 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-11 18:16:37,092 INFO L378 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 27 treesize of output 19 [2024-10-11 18:16:37,247 INFO L378 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 23 treesize of output 3 [2024-10-11 18:16:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:37,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:37,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:37,694 INFO L378 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 36 treesize of output 39 [2024-10-11 18:16:37,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-11 18:16:38,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:38,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-11 18:16:38,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2024-10-11 18:16:38,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:38,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2024-10-11 18:16:38,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2024-10-11 18:16:38,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-11 18:16:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448404046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:38,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2024-10-11 18:16:38,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202932837] [2024-10-11 18:16:38,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:38,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 18:16:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 18:16:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2842, Unknown=61, NotChecked=0, Total=3080 [2024-10-11 18:16:38,360 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 44 states, 40 states have (on average 1.925) internal successors, (77), 38 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:39,106 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2024-10-11 18:16:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 18:16:39,107 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.925) internal successors, (77), 38 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-10-11 18:16:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:39,108 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:16:39,108 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:16:39,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=280, Invalid=4211, Unknown=65, NotChecked=0, Total=4556 [2024-10-11 18:16:39,109 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 128 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:39,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 768 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:16:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:16:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2024-10-11 18:16:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.2875) internal successors, (103), 92 states have internal predecessors, (103), 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) [2024-10-11 18:16:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-10-11 18:16:39,111 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 47 [2024-10-11 18:16:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:39,111 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-10-11 18:16:39,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.925) internal successors, (77), 38 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:16:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-10-11 18:16:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:16:39,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:39,112 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:39,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:39,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 18:16:39,312 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:39,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1232046150, now seen corresponding path program 1 times [2024-10-11 18:16:39,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038924746] [2024-10-11 18:16:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:40,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038924746] [2024-10-11 18:16:40,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038924746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969259600] [2024-10-11 18:16:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:40,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:40,253 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:40,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 18:16:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:40,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-11 18:16:40,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:40,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:40,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:16:40,738 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:16:40,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:16:40,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:16:40,849 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:40,929 INFO L378 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 16 treesize of output 11 [2024-10-11 18:16:40,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:40,941 INFO L378 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 53 treesize of output 25 [2024-10-11 18:16:41,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:41,136 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-10-11 18:16:41,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 70 treesize of output 46 [2024-10-11 18:16:41,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2024-10-11 18:16:41,443 INFO L378 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 47 treesize of output 23 [2024-10-11 18:16:41,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 18:16:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:41,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:41,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:16:41,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-11 18:16:41,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5460 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5460) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_#StackHeapBarrier|)) is different from false [2024-10-11 18:16:42,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:42,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-11 18:16:42,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2024-10-11 18:16:42,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-10-11 18:16:42,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2024-10-11 18:16:42,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:42,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 75 [2024-10-11 18:16:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969259600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:42,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:42,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 41 [2024-10-11 18:16:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832103236] [2024-10-11 18:16:42,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:42,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 18:16:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:42,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 18:16:42,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2245, Unknown=34, NotChecked=96, Total=2550 [2024-10-11 18:16:42,209 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 42 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 36 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:42,850 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-10-11 18:16:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 18:16:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 36 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2024-10-11 18:16:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:42,851 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:16:42,851 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:16:42,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=226, Invalid=2935, Unknown=35, NotChecked=110, Total=3306 [2024-10-11 18:16:42,852 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 73 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:42,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 519 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:16:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:16:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-10-11 18:16:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 95 states have internal predecessors, (106), 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) [2024-10-11 18:16:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2024-10-11 18:16:42,858 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 48 [2024-10-11 18:16:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:42,858 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2024-10-11 18:16:42,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 36 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:16:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2024-10-11 18:16:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 18:16:42,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:42,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:42,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:43,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:43,059 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:43,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1294816203, now seen corresponding path program 1 times [2024-10-11 18:16:43,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608094372] [2024-10-11 18:16:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608094372] [2024-10-11 18:16:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608094372] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795358271] [2024-10-11 18:16:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:43,163 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:43,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-11 18:16:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:43,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:16:43,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:43,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:16:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795358271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:16:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-10-11 18:16:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865682326] [2024-10-11 18:16:43,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:43,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:16:43,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:43,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:16:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:16:43,536 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:43,555 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2024-10-11 18:16:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:16:43,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-10-11 18:16:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:43,555 INFO L225 Difference]: With dead ends: 53 [2024-10-11 18:16:43,555 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 18:16:43,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:16:43,556 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:43,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:16:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 18:16:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 18:16:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 49 states have internal predecessors, (49), 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) [2024-10-11 18:16:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-10-11 18:16:43,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 54 [2024-10-11 18:16:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:43,558 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2024-10-11 18:16:43,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:16:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-10-11 18:16:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 18:16:43,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:43,558 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:16:43,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:43,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-11 18:16:43,759 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:16:43,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1484598454, now seen corresponding path program 1 times [2024-10-11 18:16:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625969375] [2024-10-11 18:16:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:45,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:45,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625969375] [2024-10-11 18:16:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625969375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439959989] [2024-10-11 18:16:45,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:45,996 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:45,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-11 18:16:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:46,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-10-11 18:16:46,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:46,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:47,035 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:16:47,035 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:16:47,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:16:47,414 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:16:47,415 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 18:16:47,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:16:47,521 INFO L378 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 259 treesize of output 174 [2024-10-11 18:16:48,556 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-10-11 18:16:48,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 266 treesize of output 182 [2024-10-11 18:16:49,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 355 [2024-10-11 18:16:49,889 INFO L378 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 199 treesize of output 147 [2024-10-11 18:16:50,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 81 [2024-10-11 18:16:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:16:51,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:16:52,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-10-11 18:16:52,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:52,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2024-10-11 18:16:52,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 260 [2024-10-11 18:16:52,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:52,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 97 [2024-10-11 18:16:52,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2024-10-11 18:16:52,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2024-10-11 18:17:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439959989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:04,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:04,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 57 [2024-10-11 18:17:04,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389174292] [2024-10-11 18:17:04,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:04,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-11 18:17:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:04,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-11 18:17:04,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=5617, Unknown=4, NotChecked=0, Total=5852 [2024-10-11 18:17:04,499 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 59 states, 53 states have (on average 1.8867924528301887) internal successors, (100), 52 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)