./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/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:59:37,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:59:37,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:59:37,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:59:37,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:59:37,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:59:37,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:59:37,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:59:37,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:59:37,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:59:37,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:59:37,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:59:37,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:59:37,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:59:37,281 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:59:37,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:59:37,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:59:37,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:59:37,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:59:37,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:59:37,282 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:59:37,284 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:59:37,284 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:59:37,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:59:37,284 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:59:37,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:59:37,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:59:37,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:59:37,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:59:37,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:59:37,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:59:37,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:59:37,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:59:37,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:59:37,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:59:37,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:59:37,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:59:37,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:59:37,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:59:37,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:59:37,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:59:37,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:59:37,301 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/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/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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-10-13 10:59:37,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:59:37,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:59:37,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:59:37,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:59:37,615 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:59:37,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-10-13 10:59:39,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:59:39,315 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:59:39,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-10-13 10:59:39,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68269af1/2f7879ed9d3e4e1a83d31176a06d88c9/FLAG615ad010d [2024-10-13 10:59:39,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c68269af1/2f7879ed9d3e4e1a83d31176a06d88c9 [2024-10-13 10:59:39,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:59:39,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:59:39,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:59:39,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:59:39,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:59:39,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:39" (1/1) ... [2024-10-13 10:59:39,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1cb60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:39, skipping insertion in model container [2024-10-13 10:59:39,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:39" (1/1) ... [2024-10-13 10:59:39,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:59:39,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:59:40,008 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:59:40,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:59:40,083 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:59:40,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40 WrapperNode [2024-10-13 10:59:40,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:59:40,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:59:40,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:59:40,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:59:40,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,139 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2024-10-13 10:59:40,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:59:40,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:59:40,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:59:40,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:59:40,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,178 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-10-13 10:59:40,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:59:40,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:59:40,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:59:40,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:59:40,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (1/1) ... [2024-10-13 10:59:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:59:40,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:40,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:59:40,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:59:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:59:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:59:40,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 10:59:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:59:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:59:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:59:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-13 10:59:40,321 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-13 10:59:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:59:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:59:40,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:59:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:59:40,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:59:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:59:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:59:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:59:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:59:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:59:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 10:59:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 10:59:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 10:59:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:59:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:59:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 10:59:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:59:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:59:40,510 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:59:40,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:59:40,965 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-13 10:59:40,965 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:59:41,023 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:59:41,024 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 10:59:41,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:41 BoogieIcfgContainer [2024-10-13 10:59:41,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:59:41,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:59:41,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:59:41,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:59:41,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:59:39" (1/3) ... [2024-10-13 10:59:41,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4b8a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:41, skipping insertion in model container [2024-10-13 10:59:41,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:40" (2/3) ... [2024-10-13 10:59:41,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4b8a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:41, skipping insertion in model container [2024-10-13 10:59:41,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:41" (3/3) ... [2024-10-13 10:59:41,035 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-10-13 10:59:41,051 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:59:41,052 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-10-13 10:59:41,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:59:41,103 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;@20c30740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:59:41,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-13 10:59:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 96 states have internal predecessors, (112), 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-13 10:59:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:59:41,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:41,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:59:41,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:41,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1788653075, now seen corresponding path program 1 times [2024-10-13 10:59:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:41,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347814531] [2024-10-13 10:59:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,425 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-13 10:59:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347814531] [2024-10-13 10:59:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347814531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:41,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:59:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282921526] [2024-10-13 10:59:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:41,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:59:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:59:41,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:59:41,464 INFO L87 Difference]: Start difference. First operand has 100 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 96 states have internal predecessors, (112), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:41,604 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-10-13 10:59:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:59:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:59:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:41,613 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:59:41,614 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 10:59:41,615 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-13 10:59:41,618 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:41,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 10:59:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 10:59:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 47 states have (on average 2.106382978723404) internal successors, (99), 90 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-13 10:59:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-10-13 10:59:41,655 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 6 [2024-10-13 10:59:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:41,657 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-10-13 10:59:41,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-10-13 10:59:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:59:41,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:41,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:59:41,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:59:41,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:41,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1788653074, now seen corresponding path program 1 times [2024-10-13 10:59:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:41,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557310941] [2024-10-13 10:59:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:41,809 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-13 10:59:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557310941] [2024-10-13 10:59:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557310941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:41,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:41,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:59:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326128960] [2024-10-13 10:59:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:41,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:59:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:41,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:59:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:59:41,813 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:41,925 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-10-13 10:59:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:59:41,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:59:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:41,927 INFO L225 Difference]: With dead ends: 91 [2024-10-13 10:59:41,927 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 10:59:41,928 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-13 10:59:41,929 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:41,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 10:59:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 10:59:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 87 states have internal predecessors, (96), 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-13 10:59:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-13 10:59:41,956 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 6 [2024-10-13 10:59:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:41,956 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-13 10:59:41,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:59:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-13 10:59:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:59:41,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:41,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:59:41,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash 644676676, now seen corresponding path program 1 times [2024-10-13 10:59:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843000638] [2024-10-13 10:59:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,405 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-13 10:59:42,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843000638] [2024-10-13 10:59:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843000638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:59:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024379468] [2024-10-13 10:59:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:42,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:42,408 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-13 10:59:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:42,686 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-10-13 10:59:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-13 10:59:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:42,687 INFO L225 Difference]: With dead ends: 89 [2024-10-13 10:59:42,688 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 10:59:42,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-13 10:59:42,689 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:42,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 306 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:59:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 10:59:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 10:59:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 2.0) internal successors, (94), 85 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-13 10:59:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-13 10:59:42,705 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2024-10-13 10:59:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:42,706 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-13 10:59:42,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-13 10:59:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-13 10:59:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:59:42,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:42,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:42,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:59:42,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:42,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 644676675, now seen corresponding path program 1 times [2024-10-13 10:59:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155691926] [2024-10-13 10:59:42,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:42,861 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-13 10:59:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155691926] [2024-10-13 10:59:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155691926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:59:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634974056] [2024-10-13 10:59:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:42,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:59:42,865 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-13 10:59:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:43,072 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-10-13 10:59:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-13 10:59:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:43,073 INFO L225 Difference]: With dead ends: 87 [2024-10-13 10:59:43,073 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:59:43,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-13 10:59:43,074 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:43,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 290 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:59:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:59:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 10:59:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 83 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-13 10:59:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-10-13 10:59:43,088 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 11 [2024-10-13 10:59:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:43,088 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-10-13 10:59:43,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-13 10:59:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-10-13 10:59:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:59:43,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:43,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:43,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:59:43,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:43,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -817834319, now seen corresponding path program 1 times [2024-10-13 10:59:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994289805] [2024-10-13 10:59:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 10:59:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,166 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-13 10:59:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:43,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994289805] [2024-10-13 10:59:43,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994289805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:43,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:59:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285776534] [2024-10-13 10:59:43,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:59:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:59:43,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:59:43,171 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-13 10:59:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:43,277 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-10-13 10:59:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:59:43,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-10-13 10:59:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:43,279 INFO L225 Difference]: With dead ends: 97 [2024-10-13 10:59:43,279 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 10:59:43,279 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-13 10:59:43,281 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:43,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 197 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 10:59:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-10-13 10:59:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 1.9375) internal successors, (93), 84 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-13 10:59:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-13 10:59:43,297 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 12 [2024-10-13 10:59:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:43,297 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-13 10:59:43,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-13 10:59:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-13 10:59:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:59:43,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:43,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:43,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:59:43,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1530935535, now seen corresponding path program 1 times [2024-10-13 10:59:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136675112] [2024-10-13 10:59:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,382 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-13 10:59:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:43,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136675112] [2024-10-13 10:59:43,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136675112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:43,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:59:43,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:59:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551182636] [2024-10-13 10:59:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:43,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:59:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:59:43,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:59:43,385 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 10:59:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:43,491 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-10-13 10:59:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:59:43,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-13 10:59:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:43,493 INFO L225 Difference]: With dead ends: 93 [2024-10-13 10:59:43,493 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 10:59:43,493 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-13 10:59:43,494 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:43,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 10:59:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 10:59:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 88 states have internal predecessors, (97), 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-13 10:59:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-10-13 10:59:43,508 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 14 [2024-10-13 10:59:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:43,508 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-10-13 10:59:43,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 10:59:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-10-13 10:59:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:59:43,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:43,509 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-13 10:59:43,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:59:43,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:43,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1460399469, now seen corresponding path program 1 times [2024-10-13 10:59:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229889257] [2024-10-13 10:59:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 10:59:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,622 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-13 10:59:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229889257] [2024-10-13 10:59:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229889257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181122011] [2024-10-13 10:59:43,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:43,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:43,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:43,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:43,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:59:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:43,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:59:43,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:43,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:43,888 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-13 10:59:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181122011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:59:43,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:59:43,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-13 10:59:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249783609] [2024-10-13 10:59:43,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:43,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:59:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:43,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:59:43,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:59:43,894 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:59:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:44,019 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-10-13 10:59:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:59:44,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-13 10:59:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:44,024 INFO L225 Difference]: With dead ends: 95 [2024-10-13 10:59:44,024 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 10:59:44,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:59:44,025 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:44,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 196 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 10:59:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 10:59:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 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-13 10:59:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-10-13 10:59:44,034 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 25 [2024-10-13 10:59:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:44,035 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-10-13 10:59:44,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:59:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-10-13 10:59:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:59:44,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:44,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 10:59:44,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:59:44,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:44,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:44,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1713381069, now seen corresponding path program 1 times [2024-10-13 10:59:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461053818] [2024-10-13 10:59:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461053818] [2024-10-13 10:59:44,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461053818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017357729] [2024-10-13 10:59:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:44,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:44,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:44,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:44,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:59:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:44,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:59:44,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:44,857 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-13 10:59:44,941 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 10:59:44,942 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-13 10:59:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:59:44,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017357729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:45,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:45,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2024-10-13 10:59:45,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716868404] [2024-10-13 10:59:45,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:45,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:59:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:45,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:59:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2024-10-13 10:59:45,020 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 12 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:59:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:45,405 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-10-13 10:59:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:59:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-13 10:59:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:45,407 INFO L225 Difference]: With dead ends: 94 [2024-10-13 10:59:45,407 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 10:59:45,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-10-13 10:59:45,408 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:45,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 390 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 398 Invalid, 0 Unknown, 97 Unchecked, 0.3s Time] [2024-10-13 10:59:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 10:59:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 10:59:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 89 states have internal predecessors, (98), 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-13 10:59:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-10-13 10:59:45,413 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 27 [2024-10-13 10:59:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:45,414 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-10-13 10:59:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:59:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-10-13 10:59:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 10:59:45,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:45,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 10:59:45,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:59:45,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 10:59:45,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:45,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1713381070, now seen corresponding path program 1 times [2024-10-13 10:59:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188682363] [2024-10-13 10:59:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:46,191 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-13 10:59:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188682363] [2024-10-13 10:59:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188682363] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:46,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726397106] [2024-10-13 10:59:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:46,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:46,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:46,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:46,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:59:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:46,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:59:46,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:46,378 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-13 10:59:46,542 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-13 10:59:46,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:46,581 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-13 10:59:46,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:46,591 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-13 10:59:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-13 10:59:46,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726397106] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:46,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2024-10-13 10:59:46,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100798778] [2024-10-13 10:59:46,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:46,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:59:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:46,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:59:46,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2024-10-13 10:59:46,749 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 19 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:59:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:47,209 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-10-13 10:59:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:59:47,210 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-13 10:59:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:47,210 INFO L225 Difference]: With dead ends: 93 [2024-10-13 10:59:47,210 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 10:59:47,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=476, Unknown=1, NotChecked=44, Total=600 [2024-10-13 10:59:47,211 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:47,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 553 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 509 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2024-10-13 10:59:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 10:59:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 10:59:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 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-13 10:59:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-10-13 10:59:47,216 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2024-10-13 10:59:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:47,217 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-10-13 10:59:47,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:59:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-10-13 10:59:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:59:47,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:47,218 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:47,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:59:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:47,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:47,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash -11229135, now seen corresponding path program 2 times [2024-10-13 10:59:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:47,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461873535] [2024-10-13 10:59:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 10:59:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:59:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461873535] [2024-10-13 10:59:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461873535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:47,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795486319] [2024-10-13 10:59:47,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:59:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:47,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:47,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:59:47,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:59:47,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:59:47,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:59:47,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:59:47,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:59:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795486319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:59:47,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:59:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2024-10-13 10:59:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949050010] [2024-10-13 10:59:47,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:47,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:59:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:59:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:59:47,840 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:48,011 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-13 10:59:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:59:48,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-10-13 10:59:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:48,012 INFO L225 Difference]: With dead ends: 93 [2024-10-13 10:59:48,012 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 10:59:48,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:59:48,014 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:48,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 487 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:59:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 10:59:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 10:59:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 88 states have internal predecessors, (96), 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-13 10:59:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-13 10:59:48,020 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 38 [2024-10-13 10:59:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:48,020 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-13 10:59:48,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:59:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-13 10:59:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:59:48,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:48,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:48,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:59:48,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:48,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:48,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash 808896077, now seen corresponding path program 1 times [2024-10-13 10:59:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714243431] [2024-10-13 10:59:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 10:59:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 10:59:48,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714243431] [2024-10-13 10:59:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714243431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889148965] [2024-10-13 10:59:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:48,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:48,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:48,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:59:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:48,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:59:48,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:48,953 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-13 10:59:48,971 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-13 10:59:48,989 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-13 10:59:49,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:49,021 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-13 10:59:49,049 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-13 10:59:49,055 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-13 10:59:49,073 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:59:49,074 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-13 10:59:49,129 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-13 10:59:49,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:49,167 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-13 10:59:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 10 not checked. [2024-10-13 10:59:49,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889148965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:49,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:49,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2024-10-13 10:59:49,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205448392] [2024-10-13 10:59:49,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:49,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:59:49,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:59:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=124, Unknown=2, NotChecked=46, Total=210 [2024-10-13 10:59:49,233 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 14 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:59:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:49,570 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-10-13 10:59:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-10-13 10:59:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:49,572 INFO L225 Difference]: With dead ends: 99 [2024-10-13 10:59:49,572 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 10:59:49,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=190, Unknown=2, NotChecked=58, Total=306 [2024-10-13 10:59:49,573 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 134 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:49,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 275 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 341 Invalid, 0 Unknown, 192 Unchecked, 0.3s Time] [2024-10-13 10:59:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 10:59:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2024-10-13 10:59:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 83 states have internal predecessors, (91), 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-13 10:59:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-13 10:59:49,581 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 39 [2024-10-13 10:59:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:49,582 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-13 10:59:49,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:59:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-13 10:59:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:59:49,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:49,583 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:49,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:59:49,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 10:59:49,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:49,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash 808896078, now seen corresponding path program 1 times [2024-10-13 10:59:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:49,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183823413] [2024-10-13 10:59:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 10:59:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:59:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183823413] [2024-10-13 10:59:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183823413] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367204171] [2024-10-13 10:59:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:50,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:50,514 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:50,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:59:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:50,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 10:59:50,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:50,714 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-13 10:59:50,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 5 treesize of output 3 [2024-10-13 10:59:50,763 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-13 10:59:50,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:50,792 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-13 10:59:50,836 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-13 10:59:50,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:50,875 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-13 10:59:50,950 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-13 10:59:50,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:50,984 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-13 10:59:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-13 10:59:51,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:59:51,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367204171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:59:51,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:59:51,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2024-10-13 10:59:51,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851173174] [2024-10-13 10:59:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:59:51,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:59:51,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:51,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:59:51,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-10-13 10:59:51,009 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-13 10:59:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:51,116 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-10-13 10:59:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:59:51,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) Word has length 39 [2024-10-13 10:59:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:51,118 INFO L225 Difference]: With dead ends: 85 [2024-10-13 10:59:51,118 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 10:59:51,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2024-10-13 10:59:51,119 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:51,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2024-10-13 10:59:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 10:59:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 10:59:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 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-13 10:59:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-10-13 10:59:51,123 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 39 [2024-10-13 10:59:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:51,123 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-10-13 10:59:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-13 10:59:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-10-13 10:59:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 10:59:51,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:51,124 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:51,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:59:51,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:51,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:51,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1238445137, now seen corresponding path program 1 times [2024-10-13 10:59:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794954591] [2024-10-13 10:59:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 10:59:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 10:59:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794954591] [2024-10-13 10:59:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794954591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716685565] [2024-10-13 10:59:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:51,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:51,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:51,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:51,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:59:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:52,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 10:59:52,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:52,074 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-13 10:59:52,183 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 9 treesize of output 3 [2024-10-13 10:59:52,201 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-13 10:59:52,230 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-13 10:59:52,230 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 16 treesize of output 18 [2024-10-13 10:59:52,269 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-13 10:59:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2024-10-13 10:59:52,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:52,388 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 18 treesize of output 10 [2024-10-13 10:59:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:59:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716685565] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:59:52,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:59:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 19 [2024-10-13 10:59:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674077682] [2024-10-13 10:59:52,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:52,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:59:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:52,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:59:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2024-10-13 10:59:52,421 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 20 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 10:59:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:52,856 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-10-13 10:59:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:59:52,857 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2024-10-13 10:59:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:52,858 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:59:52,858 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:59:52,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=517, Unknown=1, NotChecked=46, Total=650 [2024-10-13 10:59:52,859 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 70 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:52,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 487 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 652 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2024-10-13 10:59:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:59:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 10:59:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.6) internal successors, (88), 79 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-13 10:59:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-10-13 10:59:52,864 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 42 [2024-10-13 10:59:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:52,864 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-10-13 10:59:52,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 10:59:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-10-13 10:59:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 10:59:52,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:52,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:52,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:59:53,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:53,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:53,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:53,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1238445136, now seen corresponding path program 1 times [2024-10-13 10:59:53,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:53,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910370470] [2024-10-13 10:59:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:53,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 10:59:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:59:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910370470] [2024-10-13 10:59:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910370470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667222588] [2024-10-13 10:59:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:53,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:53,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:53,641 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:53,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:59:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:53,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 10:59:53,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:53,905 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-13 10:59:54,067 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 9 treesize of output 3 [2024-10-13 10:59:54,179 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-13 10:59:54,179 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 18 treesize of output 21 [2024-10-13 10:59:54,233 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-13 10:59:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:59:54,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667222588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:54,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-13 10:59:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454044240] [2024-10-13 10:59:54,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:59:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:54,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:59:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:59:54,392 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 22 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:59:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:55,086 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-10-13 10:59:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:59:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2024-10-13 10:59:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:55,087 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:59:55,087 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 10:59:55,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 10:59:55,088 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 77 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:55,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 726 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:59:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 10:59:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-13 10:59:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:59:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-13 10:59:55,091 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 42 [2024-10-13 10:59:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:55,091 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-13 10:59:55,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:59:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-13 10:59:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 10:59:55,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:55,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:55,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:59:55,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 10:59:55,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:55,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 262601584, now seen corresponding path program 1 times [2024-10-13 10:59:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81330608] [2024-10-13 10:59:55,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 10:59:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 10:59:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81330608] [2024-10-13 10:59:55,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81330608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398047234] [2024-10-13 10:59:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:55,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:55,680 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:55,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:59:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:55,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 10:59:55,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:55,905 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-13 10:59:55,910 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-13 10:59:55,948 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-13 10:59:55,952 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-13 10:59:56,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:56,025 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-13 10:59:56,032 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-13 10:59:56,108 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-13 10:59:56,134 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-13 10:59:56,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:56,160 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-13 10:59:56,211 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-13 10:59:56,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:56,243 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-13 10:59:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-10-13 10:59:56,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:56,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398047234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:56,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 19 [2024-10-13 10:59:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244757140] [2024-10-13 10:59:56,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:56,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:59:56,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:59:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2024-10-13 10:59:56,398 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:59:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:59:56,876 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-10-13 10:59:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:59:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-13 10:59:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:59:56,878 INFO L225 Difference]: With dead ends: 90 [2024-10-13 10:59:56,878 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 10:59:56,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=695, Unknown=1, NotChecked=54, Total=870 [2024-10-13 10:59:56,879 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:59:56,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 447 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 623 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2024-10-13 10:59:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 10:59:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 10:59:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:59:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-10-13 10:59:56,881 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 43 [2024-10-13 10:59:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:59:56,882 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-10-13 10:59:56,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:59:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-10-13 10:59:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 10:59:56,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:59:56,882 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:59:56,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 10:59:57,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 10:59:57,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 10:59:57,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:59:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash -749965477, now seen corresponding path program 1 times [2024-10-13 10:59:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:59:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610376235] [2024-10-13 10:59:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:59:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:58,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 10:59:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 10:59:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 10:59:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:59:58,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:59:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610376235] [2024-10-13 10:59:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610376235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065553301] [2024-10-13 10:59:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:59:58,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:59:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:59:58,550 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:59:58,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:59:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:59:58,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-13 10:59:58,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:59:58,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:59:58,995 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-13 10:59:59,079 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 13 treesize of output 9 [2024-10-13 10:59:59,141 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:59:59,142 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 42 treesize of output 41 [2024-10-13 10:59:59,261 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 42 treesize of output 14 [2024-10-13 10:59:59,265 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 15 treesize of output 7 [2024-10-13 10:59:59,366 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_73| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_73| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_73|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_73|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_73| 1)))) is different from true [2024-10-13 10:59:59,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:59:59,376 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 50 treesize of output 39 [2024-10-13 10:59:59,403 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2024-10-13 10:59:59,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2024-10-13 10:59:59,517 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 84 treesize of output 56 [2024-10-13 10:59:59,521 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 51 treesize of output 35 [2024-10-13 10:59:59,623 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 41 treesize of output 17 [2024-10-13 10:59:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-13 10:59:59,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:59:59,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065553301] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:59:59,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:59:59,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2024-10-13 10:59:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630663435] [2024-10-13 10:59:59,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:59:59,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-13 10:59:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:59:59,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-13 10:59:59,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1827, Unknown=1, NotChecked=86, Total=2070 [2024-10-13 10:59:59,802 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 43 states, 35 states have (on average 2.2) internal successors, (77), 37 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:00:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:00:01,039 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-10-13 11:00:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 11:00:01,039 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 2.2) internal successors, (77), 37 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2024-10-13 11:00:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:00:01,040 INFO L225 Difference]: With dead ends: 103 [2024-10-13 11:00:01,040 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 11:00:01,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=322, Invalid=3463, Unknown=1, NotChecked=120, Total=3906 [2024-10-13 11:00:01,042 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 101 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:00:01,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1036 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1387 Invalid, 0 Unknown, 110 Unchecked, 0.8s Time] [2024-10-13 11:00:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 11:00:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2024-10-13 11:00:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.492063492063492) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:00:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-13 11:00:01,045 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 45 [2024-10-13 11:00:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:00:01,045 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-13 11:00:01,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 2.2) internal successors, (77), 37 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:00:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-13 11:00:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 11:00:01,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:00:01,046 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:00:01,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 11:00:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 11:00:01,247 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 11:00:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:00:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -749965476, now seen corresponding path program 1 times [2024-10-13 11:00:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:00:01,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415989766] [2024-10-13 11:00:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:00:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:02,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:00:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:02,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 11:00:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 11:00:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 11:00:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:00:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415989766] [2024-10-13 11:00:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415989766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:02,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512743392] [2024-10-13 11:00:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:00:02,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:00:02,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:00:02,965 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:00:02,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 11:00:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:00:03,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-13 11:00:03,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:00:03,268 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-13 11:00:03,273 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-13 11:00:03,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:00:03,598 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-13 11:00:03,605 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 12 treesize of output 14 [2024-10-13 11:00:03,755 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 13 treesize of output 9 [2024-10-13 11:00:03,766 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 13 treesize of output 9 [2024-10-13 11:00:03,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:00:03,868 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 73 treesize of output 66 [2024-10-13 11:00:03,872 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 30 treesize of output 13 [2024-10-13 11:00:04,114 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 19 [2024-10-13 11:00:04,121 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 17 treesize of output 3 [2024-10-13 11:00:04,128 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 15 treesize of output 7 [2024-10-13 11:00:04,134 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 15 treesize of output 7 [2024-10-13 11:00:16,361 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (exists ((|v_node_create_~temp~0#1.base_82| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_82|))) (= |c_#length| (store |c_old(#length)| |v_node_create_~temp~0#1.base_82| (select |c_#length| |v_node_create_~temp~0#1.base_82|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_82| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_82|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_82|) 0)))) is different from true [2024-10-13 11:00:16,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:16,376 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 69 treesize of output 52 [2024-10-13 11:00:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:16,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:00:16,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2024-10-13 11:00:16,402 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-13 11:00:16,402 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 34 treesize of output 36 [2024-10-13 11:00:16,406 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 26 treesize of output 21 [2024-10-13 11:00:16,508 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 75 treesize of output 51 [2024-10-13 11:00:16,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:00:16,516 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 64 treesize of output 48 [2024-10-13 11:00:16,635 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 31 treesize of output 13 [2024-10-13 11:00:16,639 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 9 treesize of output 3 [2024-10-13 11:00:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 11:00:16,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:00:17,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512743392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:00:17,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:00:17,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 49 [2024-10-13 11:00:17,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380416421] [2024-10-13 11:00:17,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:00:17,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:00:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:00:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:00:17,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2693, Unknown=4, NotChecked=104, Total=2970 [2024-10-13 11:00:17,153 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 50 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 43 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:00:21,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:00:25,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:00:37,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:00:41,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:00:45,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:00:53,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 11:01:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:11,151 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-10-13 11:01:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 11:01:11,152 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 43 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2024-10-13 11:01:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:11,153 INFO L225 Difference]: With dead ends: 98 [2024-10-13 11:01:11,154 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 11:01:11,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=337, Invalid=4768, Unknown=11, NotChecked=140, Total=5256 [2024-10-13 11:01:11,155 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 94 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:11,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1138 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1753 Invalid, 6 Unknown, 107 Unchecked, 25.1s Time] [2024-10-13 11:01:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 11:01:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-10-13 11:01:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.476923076923077) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-13 11:01:11,159 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 45 [2024-10-13 11:01:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:11,159 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-13 11:01:11,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 43 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:01:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-13 11:01:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 11:01:11,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:11,160 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:11,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:01:11,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 11:01:11,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 11:01:11,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash -749971628, now seen corresponding path program 1 times [2024-10-13 11:01:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600676389] [2024-10-13 11:01:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:01:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 11:01:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 11:01:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 11:01:11,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:11,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600676389] [2024-10-13 11:01:11,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600676389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:11,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:11,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373926584] [2024-10-13 11:01:11,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:11,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:11,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:11,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:11,524 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-13 11:01:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:01:11,645 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-10-13 11:01:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:01:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 45 [2024-10-13 11:01:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:01:11,646 INFO L225 Difference]: With dead ends: 92 [2024-10-13 11:01:11,646 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 11:01:11,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-13 11:01:11,647 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:01:11,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 240 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:01:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 11:01:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 11:01:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 11:01:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-13 11:01:11,650 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 45 [2024-10-13 11:01:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:01:11,650 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-13 11:01:11,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-13 11:01:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-13 11:01:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 11:01:11,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:01:11,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:01:11,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 11:01:11,652 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-13 11:01:11,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:01:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash -749971627, now seen corresponding path program 1 times [2024-10-13 11:01:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:01:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878111871] [2024-10-13 11:01:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:01:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:01:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 11:01:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-13 11:01:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 11:01:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:01:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 11:01:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:01:11,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878111871] [2024-10-13 11:01:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878111871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:01:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:01:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:01:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443833567] [2024-10-13 11:01:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:01:11,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:01:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:01:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:01:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:01:11,905 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 7 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)