./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-simple/sll2c_prepend_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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:41:45,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:41:45,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:41:45,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:41:45,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:41:45,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:41:45,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:41:45,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:41:45,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:41:45,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:41:45,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:41:45,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:41:45,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:41:45,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:41:45,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:41:45,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:41:45,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:41:45,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:41:45,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:41:45,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:41:45,441 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:41:45,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:41:45,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:41:45,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:41:45,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:41:45,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:41:45,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:41:45,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:41:45,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:41:45,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:41:45,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:41:45,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:41:45,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:41:45,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:41:45,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:41:45,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:41:45,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:41:45,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:41:45,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:41:45,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:41:45,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:41:45,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:41:45,447 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2024-11-12 13:41:45,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:41:45,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:41:45,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:41:45,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:41:45,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:41:45,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-12 13:41:46,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:41:47,136 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:41:47,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2024-11-12 13:41:47,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9d4c2eb/3a14f3ee8c2e4dddb6d0a8a5460c9ce4/FLAG3061d742e [2024-11-12 13:41:47,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9d4c2eb/3a14f3ee8c2e4dddb6d0a8a5460c9ce4 [2024-11-12 13:41:47,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:41:47,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:41:47,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:41:47,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:41:47,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:41:47,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303d871d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47, skipping insertion in model container [2024-11-12 13:41:47,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:41:47,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:41:47,844 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:41:47,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:41:47,909 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:41:47,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47 WrapperNode [2024-11-12 13:41:47,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:41:47,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:41:47,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:41:47,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:41:47,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,948 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 157 [2024-11-12 13:41:47,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:41:47,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:41:47,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:41:47,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:41:47,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,989 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 15, 10]. 56 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, 7, 2]. [2024-11-12 13:41:47,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:47,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:48,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:48,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:48,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:48,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:41:48,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:41:48,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:41:48,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:41:48,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (1/1) ... [2024-11-12 13:41:48,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:41:48,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:48,047 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-11-12 13:41:48,050 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-11-12 13:41:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:41:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:41:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 13:41:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:41:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:41:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 13:41:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-12 13:41:48,091 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-12 13:41:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:41:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:41:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:41:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:41:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 13:41:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:41:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:41:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:41:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:41:48,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:41:48,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:41:48,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:41:48,530 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-12 13:41:48,530 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:41:48,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:41:48,544 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 13:41:48,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:41:48 BoogieIcfgContainer [2024-11-12 13:41:48,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:41:48,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:41:48,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:41:48,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:41:48,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:41:47" (1/3) ... [2024-11-12 13:41:48,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f44f9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:41:48, skipping insertion in model container [2024-11-12 13:41:48,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:41:47" (2/3) ... [2024-11-12 13:41:48,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f44f9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:41:48, skipping insertion in model container [2024-11-12 13:41:48,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:41:48" (3/3) ... [2024-11-12 13:41:48,550 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2024-11-12 13:41:48,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:41:48,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-11-12 13:41:48,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:41:48,617 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;@4f43ef59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:41:48,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-12 13:41:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 70 states have (on average 2.0142857142857142) internal successors, (141), 126 states have internal predecessors, (141), 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-11-12 13:41:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:41:48,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:48,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:41:48,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:48,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash 895798677, now seen corresponding path program 1 times [2024-11-12 13:41:48,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:48,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626799870] [2024-11-12 13:41:48,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:41:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626799870] [2024-11-12 13:41:48,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626799870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:48,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:41:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847713622] [2024-11-12 13:41:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:48,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:41:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:41:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:41:48,886 INFO L87 Difference]: Start difference. First operand has 131 states, 70 states have (on average 2.0142857142857142) internal successors, (141), 126 states have internal predecessors, (141), 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) 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-11-12 13:41:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:48,998 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-11-12 13:41:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:41:49,000 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-11-12 13:41:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:49,008 INFO L225 Difference]: With dead ends: 128 [2024-11-12 13:41:49,008 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 13:41:49,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:41:49,014 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:49,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 13:41:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-12 13:41:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 120 states have internal predecessors, (128), 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-11-12 13:41:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2024-11-12 13:41:49,057 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2024-11-12 13:41:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:49,057 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2024-11-12 13:41:49,058 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-11-12 13:41:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2024-11-12 13:41:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:41:49,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:49,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:41:49,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:41:49,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:49,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 895798678, now seen corresponding path program 1 times [2024-11-12 13:41:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976140723] [2024-11-12 13:41:49,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:41:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976140723] [2024-11-12 13:41:49,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976140723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:49,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:49,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:41:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820996648] [2024-11-12 13:41:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:41:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:41:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:41:49,188 INFO L87 Difference]: Start difference. First operand 125 states and 134 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-11-12 13:41:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:49,269 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-12 13:41:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:41:49,272 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-11-12 13:41:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:49,273 INFO L225 Difference]: With dead ends: 123 [2024-11-12 13:41:49,273 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 13:41:49,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:41:49,276 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:49,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 209 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 13:41:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-12 13:41:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 118 states have internal predecessors, (126), 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-11-12 13:41:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2024-11-12 13:41:49,284 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 6 [2024-11-12 13:41:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:49,284 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2024-11-12 13:41:49,284 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-11-12 13:41:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2024-11-12 13:41:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:41:49,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:49,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:49,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:41:49,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:49,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1514276905, now seen corresponding path program 1 times [2024-11-12 13:41:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:49,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358415461] [2024-11-12 13:41:49,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:41:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358415461] [2024-11-12 13:41:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358415461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:49,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:41:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402511851] [2024-11-12 13:41:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:41:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:41:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:41:49,427 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11-12 13:41:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:49,543 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2024-11-12 13:41:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:41:49,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-12 13:41:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:49,545 INFO L225 Difference]: With dead ends: 130 [2024-11-12 13:41:49,545 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 13:41:49,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-12 13:41:49,546 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:49,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 303 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 13:41:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2024-11-12 13:41:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 119 states have internal predecessors, (127), 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-11-12 13:41:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2024-11-12 13:41:49,561 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 13 [2024-11-12 13:41:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:49,561 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2024-11-12 13:41:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11-12 13:41:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2024-11-12 13:41:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:41:49,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:49,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:41:49,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1934112740, now seen corresponding path program 1 times [2024-11-12 13:41:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937904328] [2024-11-12 13:41:49,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:41:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937904328] [2024-11-12 13:41:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937904328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:41:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712007928] [2024-11-12 13:41:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:49,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:41:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:41:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:49,736 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-11-12 13:41:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:49,981 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-12 13:41:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:41:49,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2024-11-12 13:41:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:49,982 INFO L225 Difference]: With dead ends: 123 [2024-11-12 13:41:49,983 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 13:41:49,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:49,985 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:49,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 440 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:41:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 13:41:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-12 13:41:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 118 states have internal predecessors, (126), 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-11-12 13:41:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2024-11-12 13:41:49,992 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2024-11-12 13:41:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:49,992 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2024-11-12 13:41:49,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-11-12 13:41:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2024-11-12 13:41:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:41:49,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:49,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:41:49,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1934112739, now seen corresponding path program 1 times [2024-11-12 13:41:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276445152] [2024-11-12 13:41:49,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:50,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:50,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276445152] [2024-11-12 13:41:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276445152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:50,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:41:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183803155] [2024-11-12 13:41:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:50,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:41:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:41:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:50,249 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-12 13:41:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:50,449 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-11-12 13:41:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:41:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2024-11-12 13:41:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:50,451 INFO L225 Difference]: With dead ends: 122 [2024-11-12 13:41:50,451 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 13:41:50,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:50,452 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:50,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 464 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:41:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 13:41:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-12 13:41:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.838235294117647) internal successors, (125), 117 states have internal predecessors, (125), 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-11-12 13:41:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2024-11-12 13:41:50,463 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 22 [2024-11-12 13:41:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:50,464 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2024-11-12 13:41:50,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-12 13:41:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2024-11-12 13:41:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:41:50,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:50,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:50,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:41:50,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:50,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2128594629, now seen corresponding path program 1 times [2024-11-12 13:41:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305777025] [2024-11-12 13:41:50,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:41:50,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305777025] [2024-11-12 13:41:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305777025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624246512] [2024-11-12 13:41:50,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:50,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:50,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:50,731 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-11-12 13:41:50,733 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-11-12 13:41:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:50,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 13:41:50,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:50,874 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-11-12 13:41:50,913 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-11-12 13:41:50,954 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:41:50,955 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-11-12 13:41:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-12 13:41:50,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:51,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624246512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:41:51,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:41:51,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-12 13:41:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714518275] [2024-11-12 13:41:51,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:51,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:41:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:41:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-12 13:41:51,149 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:41:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:51,452 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2024-11-12 13:41:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:41:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-12 13:41:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:51,453 INFO L225 Difference]: With dead ends: 121 [2024-11-12 13:41:51,453 INFO L226 Difference]: Without dead ends: 121 [2024-11-12 13:41:51,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:41:51,454 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:51,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 627 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 123 Unchecked, 0.3s Time] [2024-11-12 13:41:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-12 13:41:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-12 13:41:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 116 states have internal predecessors, (124), 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-11-12 13:41:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2024-11-12 13:41:51,464 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 25 [2024-11-12 13:41:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2024-11-12 13:41:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:41:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2024-11-12 13:41:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:41:51,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:51,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:51,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:41:51,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 13:41:51,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:51,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2128594630, now seen corresponding path program 1 times [2024-11-12 13:41:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554448370] [2024-11-12 13:41:51,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:41:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554448370] [2024-11-12 13:41:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554448370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:52,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982335784] [2024-11-12 13:41:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:52,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:52,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:52,026 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-11-12 13:41:52,027 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-11-12 13:41:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:52,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 13:41:52,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:52,123 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-11-12 13:41:52,292 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-11-12 13:41:52,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:52,334 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 16 treesize of output 11 [2024-11-12 13:41:52,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:41:52,345 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-11-12 13:41:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:41:52,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982335784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:52,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:41:52,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-12 13:41:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852948782] [2024-11-12 13:41:52,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:52,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:41:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:52,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:41:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:41:52,496 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:41:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:52,884 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-12 13:41:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:41:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-12 13:41:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:52,886 INFO L225 Difference]: With dead ends: 128 [2024-11-12 13:41:52,886 INFO L226 Difference]: Without dead ends: 128 [2024-11-12 13:41:52,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=392, Unknown=1, NotChecked=40, Total=506 [2024-11-12 13:41:52,887 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 3 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:52,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 677 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 601 Invalid, 0 Unknown, 134 Unchecked, 0.3s Time] [2024-11-12 13:41:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-12 13:41:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-11-12 13:41:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.7808219178082192) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:41:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2024-11-12 13:41:52,892 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 25 [2024-11-12 13:41:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:52,892 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2024-11-12 13:41:52,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:41:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2024-11-12 13:41:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:41:52,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:52,893 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:52,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 13:41:53,093 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,SelfDestructingSolverStorable6 [2024-11-12 13:41:53,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash -629925729, now seen corresponding path program 1 times [2024-11-12 13:41:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358873055] [2024-11-12 13:41:53,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:41:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:53,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:53,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358873055] [2024-11-12 13:41:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358873055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:53,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592195245] [2024-11-12 13:41:53,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:53,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:53,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:53,437 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-11-12 13:41:53,438 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-11-12 13:41:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:53,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 13:41:53,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:53,557 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-11-12 13:41:53,575 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-11-12 13:41:53,625 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:41:53,626 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-11-12 13:41:53,668 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:41:53,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:41:53,715 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-11-12 13:41:53,734 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:41:53,734 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-11-12 13:41:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2024-11-12 13:41:53,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592195245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:54,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:41:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-12 13:41:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391422510] [2024-11-12 13:41:54,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:54,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:41:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:54,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:41:54,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=340, Unknown=2, NotChecked=78, Total=506 [2024-11-12 13:41:54,036 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:41:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:54,362 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-12 13:41:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:41:54,362 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-11-12 13:41:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:54,363 INFO L225 Difference]: With dead ends: 136 [2024-11-12 13:41:54,363 INFO L226 Difference]: Without dead ends: 136 [2024-11-12 13:41:54,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=444, Unknown=2, NotChecked=90, Total=650 [2024-11-12 13:41:54,364 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 390 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:54,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 341 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 398 Invalid, 0 Unknown, 266 Unchecked, 0.2s Time] [2024-11-12 13:41:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-12 13:41:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2024-11-12 13:41:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 112 states have internal predecessors, (121), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:41:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-12 13:41:54,368 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 37 [2024-11-12 13:41:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:54,368 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-12 13:41:54,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:41:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-12 13:41:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:41:54,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:54,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:54,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 13:41:54,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:54,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:54,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash -629925728, now seen corresponding path program 1 times [2024-11-12 13:41:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:54,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50137863] [2024-11-12 13:41:54,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:54,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:41:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:54,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:54,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50137863] [2024-11-12 13:41:54,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50137863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:54,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294012603] [2024-11-12 13:41:54,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:54,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:54,954 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-11-12 13:41:54,955 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-11-12 13:41:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:55,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:41:55,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:55,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 8 treesize of output 1 [2024-11-12 13:41:55,080 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-11-12 13:41:55,095 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-11-12 13:41:55,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:55,128 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-11-12 13:41:55,145 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-11-12 13:41:55,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:55,176 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-11-12 13:41:55,233 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-11-12 13:41:55,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:55,273 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-11-12 13:41:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-12 13:41:55,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:41:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294012603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:41:55,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2024-11-12 13:41:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623629872] [2024-11-12 13:41:55,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:41:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:55,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:41:55,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:41:55,279 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:41:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:55,383 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2024-11-12 13:41:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:41:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-12 13:41:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:55,385 INFO L225 Difference]: With dead ends: 112 [2024-11-12 13:41:55,385 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 13:41:55,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-12 13:41:55,385 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 22 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:55,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 266 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 142 Unchecked, 0.1s Time] [2024-11-12 13:41:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 13:41:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 13:41:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 73 states have (on average 1.5753424657534247) internal successors, (115), 106 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:41:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2024-11-12 13:41:55,389 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 37 [2024-11-12 13:41:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:55,389 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2024-11-12 13:41:55,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:41:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2024-11-12 13:41:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:41:55,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:55,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:55,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 13:41:55,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:55,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:55,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -611540812, now seen corresponding path program 2 times [2024-11-12 13:41:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:55,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356806602] [2024-11-12 13:41:55,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-12 13:41:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-12 13:41:55,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356806602] [2024-11-12 13:41:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356806602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628031504] [2024-11-12 13:41:55,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:41:55,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:55,689 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-11-12 13:41:55,690 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-11-12 13:41:55,809 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:41:55,809 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:41:55,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:41:55,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:41:55,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:41:55,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628031504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:55,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:41:55,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-12 13:41:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611331523] [2024-11-12 13:41:55,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:55,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:41:55,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:55,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:41:55,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:41:55,830 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:41:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:55,840 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2024-11-12 13:41:55,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:41:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-12 13:41:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:55,841 INFO L225 Difference]: With dead ends: 105 [2024-11-12 13:41:55,841 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 13:41:55,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:41:55,842 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:55,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:41:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 13:41:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-12 13:41:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 100 states have internal predecessors, (107), 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-11-12 13:41:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2024-11-12 13:41:55,845 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 37 [2024-11-12 13:41:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:55,845 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2024-11-12 13:41:55,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:41:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2024-11-12 13:41:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:41:55,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:55,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:55,860 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-11-12 13:41:56,046 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,SelfDestructingSolverStorable9 [2024-11-12 13:41:56,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1405270422, now seen corresponding path program 1 times [2024-11-12 13:41:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955996456] [2024-11-12 13:41:56,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:41:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:41:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:56,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955996456] [2024-11-12 13:41:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955996456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:56,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:41:56,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:41:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933032733] [2024-11-12 13:41:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:56,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:41:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:56,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:41:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:41:56,153 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:41:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:56,316 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-11-12 13:41:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:41:56,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-12 13:41:56,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:56,317 INFO L225 Difference]: With dead ends: 103 [2024-11-12 13:41:56,317 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 13:41:56,318 INFO L434 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-11-12 13:41:56,318 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:56,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 364 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:41:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 13:41:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 13:41:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 98 states have internal predecessors, (105), 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-11-12 13:41:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-12 13:41:56,321 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 40 [2024-11-12 13:41:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:56,321 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-12 13:41:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:41:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-12 13:41:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:41:56,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:56,322 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:56,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:41:56,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1405270421, now seen corresponding path program 1 times [2024-11-12 13:41:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523806891] [2024-11-12 13:41:56,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:41:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:41:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523806891] [2024-11-12 13:41:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523806891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15241268] [2024-11-12 13:41:56,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:56,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:56,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:56,536 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-11-12 13:41:56,538 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-11-12 13:41:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:56,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 13:41:56,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:56,683 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-11-12 13:41:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 13:41:56,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:41:56,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15241268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:56,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:41:56,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-12 13:41:56,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765076274] [2024-11-12 13:41:56,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:56,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:41:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:41:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:41:56,757 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:41:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:56,862 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-12 13:41:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:41:56,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-12 13:41:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:56,864 INFO L225 Difference]: With dead ends: 101 [2024-11-12 13:41:56,864 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 13:41:56,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:41:56,865 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 19 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:56,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 331 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:41:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 13:41:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-12 13:41:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 96 states have internal predecessors, (103), 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-11-12 13:41:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2024-11-12 13:41:56,868 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 40 [2024-11-12 13:41:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:56,869 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2024-11-12 13:41:56,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:41:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2024-11-12 13:41:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:41:56,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:56,870 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:56,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:41:57,070 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-11-12 13:41:57,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:57,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash -613463835, now seen corresponding path program 1 times [2024-11-12 13:41:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:57,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887649872] [2024-11-12 13:41:57,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:57,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:57,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:41:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:41:57,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:57,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887649872] [2024-11-12 13:41:57,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887649872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:57,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269743667] [2024-11-12 13:41:57,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:57,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:57,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:57,416 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-11-12 13:41:57,418 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-11-12 13:41:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:57,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 13:41:57,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:57,721 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-11-12 13:41:57,738 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-11-12 13:41:57,758 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-12 13:41:57,758 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-11-12 13:41:57,812 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-11-12 13:41:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:41:57,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:41:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269743667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:41:57,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:41:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 21 [2024-11-12 13:41:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296566582] [2024-11-12 13:41:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:41:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:41:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:41:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=370, Unknown=1, NotChecked=38, Total=462 [2024-11-12 13:41:57,817 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:41:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:41:57,958 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-12 13:41:57,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:41:57,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-12 13:41:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:41:57,959 INFO L225 Difference]: With dead ends: 100 [2024-11-12 13:41:57,959 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 13:41:57,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=484, Unknown=1, NotChecked=44, Total=600 [2024-11-12 13:41:57,960 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:41:57,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 355 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 175 Unchecked, 0.1s Time] [2024-11-12 13:41:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 13:41:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 13:41:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 95 states have internal predecessors, (103), 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-11-12 13:41:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-12 13:41:57,962 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 41 [2024-11-12 13:41:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:41:57,962 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-12 13:41:57,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:41:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-12 13:41:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:41:57,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:41:57,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:41:57,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 13:41:58,163 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-11-12 13:41:58,163 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:41:58,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:41:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash -613463834, now seen corresponding path program 1 times [2024-11-12 13:41:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:41:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652253280] [2024-11-12 13:41:58,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:41:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:41:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:41:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:41:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:41:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:41:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652253280] [2024-11-12 13:41:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652253280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408430164] [2024-11-12 13:41:58,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:41:58,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:41:58,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:41:58,577 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-11-12 13:41:58,588 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-11-12 13:41:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:41:58,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-12 13:41:58,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:41:58,746 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-11-12 13:41:58,944 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-11-12 13:41:58,946 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-11-12 13:41:58,977 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 0) 0)) (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-11-12 13:41:59,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:41:59,005 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 18 treesize of output 13 [2024-11-12 13:41:59,011 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:41:59,011 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 15 treesize of output 15 [2024-11-12 13:41:59,065 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-11-12 13:41:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-12 13:41:59,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:41:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408430164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:41:59,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:41:59,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-11-12 13:41:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036866655] [2024-11-12 13:41:59,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:41:59,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:41:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:41:59,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:41:59,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=850, Unknown=1, NotChecked=58, Total=992 [2024-11-12 13:41:59,272 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 28 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:42:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:00,024 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2024-11-12 13:42:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:42:00,025 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-12 13:42:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:00,026 INFO L225 Difference]: With dead ends: 115 [2024-11-12 13:42:00,026 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 13:42:00,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1892, Unknown=1, NotChecked=88, Total=2162 [2024-11-12 13:42:00,027 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 118 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:00,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1009 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 954 Invalid, 0 Unknown, 117 Unchecked, 0.4s Time] [2024-11-12 13:42:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 13:42:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-12 13:42:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 109 states have internal predecessors, (117), 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-11-12 13:42:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2024-11-12 13:42:00,030 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 41 [2024-11-12 13:42:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:00,030 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2024-11-12 13:42:00,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:42:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2024-11-12 13:42:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:42:00,030 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:00,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:00,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 13:42:00,234 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-11-12 13:42:00,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:00,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1845142804, now seen corresponding path program 1 times [2024-11-12 13:42:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932643508] [2024-11-12 13:42:00,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:42:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:00,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932643508] [2024-11-12 13:42:00,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932643508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:00,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735170482] [2024-11-12 13:42:00,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:00,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:00,420 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-11-12 13:42:00,421 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-11-12 13:42:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:00,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 13:42:00,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:00,590 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-11-12 13:42:00,613 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-11-12 13:42:00,625 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-11-12 13:42:00,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:00,647 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-11-12 13:42:00,665 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-11-12 13:42:00,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:00,690 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-11-12 13:42:00,728 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-11-12 13:42:00,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:00,754 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-11-12 13:42:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-12 13:42:00,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:42:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735170482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:42:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-12 13:42:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302062346] [2024-11-12 13:42:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:42:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:42:00,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2024-11-12 13:42:00,782 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:42:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:00,843 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-12 13:42:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:42:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-12 13:42:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:00,844 INFO L225 Difference]: With dead ends: 112 [2024-11-12 13:42:00,844 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 13:42:00,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=156, Unknown=1, NotChecked=24, Total=210 [2024-11-12 13:42:00,845 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:00,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 197 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2024-11-12 13:42:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 13:42:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 13:42:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 106 states have internal predecessors, (114), 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-11-12 13:42:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-12 13:42:00,851 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 42 [2024-11-12 13:42:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:00,851 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-12 13:42:00,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:42:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-12 13:42:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:42:00,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:00,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:00,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-12 13:42:01,052 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-11-12 13:42:01,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:01,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:01,053 INFO L85 PathProgramCache]: Analyzing trace with hash 639259564, now seen corresponding path program 1 times [2024-11-12 13:42:01,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:01,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486763608] [2024-11-12 13:42:01,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:01,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:42:01,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486763608] [2024-11-12 13:42:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486763608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:42:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588081694] [2024-11-12 13:42:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:42:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:01,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:42:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:42:01,270 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:42:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:01,449 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2024-11-12 13:42:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:42:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-11-12 13:42:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:01,451 INFO L225 Difference]: With dead ends: 113 [2024-11-12 13:42:01,451 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 13:42:01,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:42:01,452 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:01,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 424 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:42:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 13:42:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-12 13:42:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 103 states have internal predecessors, (111), 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-11-12 13:42:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2024-11-12 13:42:01,456 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 44 [2024-11-12 13:42:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:01,456 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2024-11-12 13:42:01,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:42:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2024-11-12 13:42:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:42:01,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:01,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:01,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:42:01,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:01,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 639259565, now seen corresponding path program 1 times [2024-11-12 13:42:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013929451] [2024-11-12 13:42:01,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:42:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013929451] [2024-11-12 13:42:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013929451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24804634] [2024-11-12 13:42:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:01,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:01,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:01,655 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-11-12 13:42:01,657 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-11-12 13:42:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:01,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 13:42:01,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:02,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:02,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:02,008 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 16 treesize of output 11 [2024-11-12 13:42:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:42:02,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:02,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:02,060 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 17 treesize of output 17 [2024-11-12 13:42:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 13:42:02,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24804634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:42:02,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:42:02,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2024-11-12 13:42:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258720680] [2024-11-12 13:42:02,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:02,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 13:42:02,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:02,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 13:42:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:42:02,198 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:42:06,219 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-11-12 13:42:10,233 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-11-12 13:42:14,243 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-11-12 13:42:18,271 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-11-12 13:42:22,284 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-11-12 13:42:26,478 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-11-12 13:42:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:26,523 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2024-11-12 13:42:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:42:26,524 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 44 [2024-11-12 13:42:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:26,524 INFO L225 Difference]: With dead ends: 107 [2024-11-12 13:42:26,524 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 13:42:26,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:42:26,525 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 96 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:26,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1112 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-11-12 13:42:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 13:42:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-12 13:42:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 101 states have internal predecessors, (108), 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-11-12 13:42:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2024-11-12 13:42:26,528 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 44 [2024-11-12 13:42:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:26,528 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2024-11-12 13:42:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 20 states have internal predecessors, (62), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:42:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-12 13:42:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 13:42:26,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:26,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:26,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 13:42:26,729 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,SelfDestructingSolverStorable16 [2024-11-12 13:42:26,729 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:26,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1461806536, now seen corresponding path program 1 times [2024-11-12 13:42:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983283136] [2024-11-12 13:42:26,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:27,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:27,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:42:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983283136] [2024-11-12 13:42:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983283136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946457737] [2024-11-12 13:42:27,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:27,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:27,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:27,500 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-11-12 13:42:27,502 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-11-12 13:42:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:27,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-12 13:42:27,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:27,766 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-11-12 13:42:27,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:42:27,910 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-11-12 13:42:27,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:28,081 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:42:28,081 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 34 treesize of output 33 [2024-11-12 13:42:28,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-12 13:42:28,224 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-11-12 13:42:28,379 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8| Int)) (<= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2024-11-12 13:42:28,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:28,400 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 38 treesize of output 27 [2024-11-12 13:42:28,428 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-11-12 13:42:28,429 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 34 treesize of output 57 [2024-11-12 13:42:28,566 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 66 treesize of output 38 [2024-11-12 13:42:28,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:28,849 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 22 treesize of output 18 [2024-11-12 13:42:28,926 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 33 treesize of output 17 [2024-11-12 13:42:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:42:29,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946457737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:29,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:42:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 48 [2024-11-12 13:42:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216431001] [2024-11-12 13:42:29,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-12 13:42:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-12 13:42:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2489, Unknown=1, NotChecked=100, Total=2756 [2024-11-12 13:42:29,251 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 49 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:42:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:30,917 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2024-11-12 13:42:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 13:42:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2024-11-12 13:42:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:30,917 INFO L225 Difference]: With dead ends: 109 [2024-11-12 13:42:30,918 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 13:42:30,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=359, Invalid=4756, Unknown=1, NotChecked=140, Total=5256 [2024-11-12 13:42:30,919 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 148 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:30,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1771 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1859 Invalid, 0 Unknown, 111 Unchecked, 0.9s Time] [2024-11-12 13:42:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 13:42:30,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 13:42:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 103 states have internal predecessors, (111), 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-11-12 13:42:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2024-11-12 13:42:30,922 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 46 [2024-11-12 13:42:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:30,922 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2024-11-12 13:42:30,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:42:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2024-11-12 13:42:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 13:42:30,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:30,923 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:30,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 13:42:31,123 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,SelfDestructingSolverStorable17 [2024-11-12 13:42:31,123 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:31,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1461806537, now seen corresponding path program 1 times [2024-11-12 13:42:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321474076] [2024-11-12 13:42:31,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:42:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321474076] [2024-11-12 13:42:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321474076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127294955] [2024-11-12 13:42:32,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:32,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:32,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:32,310 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:32,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 13:42:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:32,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-12 13:42:32,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:32,534 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-11-12 13:42:32,540 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-11-12 13:42:32,776 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:42:32,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:42:32,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:42:32,786 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-11-12 13:42:32,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:32,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:33,000 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:42:33,000 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 59 treesize of output 52 [2024-11-12 13:42:33,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 13:42:33,184 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 55 treesize of output 19 [2024-11-12 13:42:33,190 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 15 treesize of output 3 [2024-11-12 13:42:33,194 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-11-12 13:42:33,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-12 13:42:33,372 WARN L873 $PredicateComparison]: unable to prove that (and (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|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9| Int)) (<= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2024-11-12 13:42:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:33,402 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 63 treesize of output 46 [2024-11-12 13:42:33,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:33,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-12 13:42:33,425 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-12 13:42:33,426 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 32 treesize of output 34 [2024-11-12 13:42:33,430 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 24 treesize of output 19 [2024-11-12 13:42:33,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2024-11-12 13:42:33,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:33,715 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 58 treesize of output 42 [2024-11-12 13:42:33,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:42:33,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:42:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:42:33,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:34,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127294955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:34,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:42:34,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 51 [2024-11-12 13:42:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841089686] [2024-11-12 13:42:34,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:34,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 13:42:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 13:42:34,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3142, Unknown=1, NotChecked=112, Total=3422 [2024-11-12 13:42:34,338 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 52 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 45 states have internal predecessors, (79), 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-11-12 13:42:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:36,714 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2024-11-12 13:42:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 13:42:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 45 states have internal predecessors, (79), 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 46 [2024-11-12 13:42:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:36,715 INFO L225 Difference]: With dead ends: 117 [2024-11-12 13:42:36,715 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 13:42:36,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=357, Invalid=6126, Unknown=1, NotChecked=158, Total=6642 [2024-11-12 13:42:36,717 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 129 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:36,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1953 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2519 Invalid, 0 Unknown, 119 Unchecked, 1.3s Time] [2024-11-12 13:42:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 13:42:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-12 13:42:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 106 states have internal predecessors, (114), 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-11-12 13:42:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-12 13:42:36,719 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 46 [2024-11-12 13:42:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:36,719 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-12 13:42:36,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 45 states have internal predecessors, (79), 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-11-12 13:42:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-12 13:42:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:42:36,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:36,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:36,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-12 13:42:36,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:36,920 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:36,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:36,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1514348859, now seen corresponding path program 2 times [2024-11-12 13:42:36,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:36,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107099500] [2024-11-12 13:42:36,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:42:37,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107099500] [2024-11-12 13:42:37,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107099500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:37,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885020576] [2024-11-12 13:42:37,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:42:37,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:37,896 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 13:42:38,074 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:42:38,074 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:42:38,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-12 13:42:38,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:38,109 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-11-12 13:42:38,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:42:38,315 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-11-12 13:42:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:42:38,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:38,495 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:42:38,495 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 53 treesize of output 35 [2024-11-12 13:42:38,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 13:42:38,647 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-12 13:42:38,647 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-11-12 13:42:38,652 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-11-12 13:42:38,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-12 13:42:38,841 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10| Int)) (<= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_10|) 0) 0)) (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|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2024-11-12 13:42:38,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:38,888 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-12 13:42:38,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-11-12 13:42:38,915 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-12 13:42:38,915 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 36 treesize of output 52 [2024-11-12 13:42:38,921 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 20 treesize of output 15 [2024-11-12 13:42:39,267 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 76 treesize of output 44 [2024-11-12 13:42:39,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:42:39,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:42:39,565 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-12 13:42:39,565 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2024-11-12 13:42:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:42:39,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885020576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:40,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:42:40,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2024-11-12 13:42:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952534110] [2024-11-12 13:42:40,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:40,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-12 13:42:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:40,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-12 13:42:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3571, Unknown=1, NotChecked=120, Total=3906 [2024-11-12 13:42:40,026 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 56 states, 53 states have (on average 1.679245283018868) internal successors, (89), 49 states have internal predecessors, (89), 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-11-12 13:42:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:41,817 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-11-12 13:42:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-12 13:42:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 1.679245283018868) internal successors, (89), 49 states have internal predecessors, (89), 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 51 [2024-11-12 13:42:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:41,818 INFO L225 Difference]: With dead ends: 116 [2024-11-12 13:42:41,818 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 13:42:41,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=457, Invalid=6686, Unknown=1, NotChecked=166, Total=7310 [2024-11-12 13:42:41,820 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 177 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:41,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1803 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1824 Invalid, 0 Unknown, 119 Unchecked, 0.8s Time] [2024-11-12 13:42:41,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 13:42:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-12 13:42:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 108 states have internal predecessors, (117), 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-11-12 13:42:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-11-12 13:42:41,822 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 51 [2024-11-12 13:42:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:41,823 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-11-12 13:42:41,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 1.679245283018868) internal successors, (89), 49 states have internal predecessors, (89), 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-11-12 13:42:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-11-12 13:42:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:42:41,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:41,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:41,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-12 13:42:42,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-12 13:42:42,024 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:42,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1514348858, now seen corresponding path program 2 times [2024-11-12 13:42:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955830435] [2024-11-12 13:42:42,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:42:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955830435] [2024-11-12 13:42:43,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955830435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:43,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786146769] [2024-11-12 13:42:43,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:42:43,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:43,026 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:43,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-12 13:42:43,211 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:42:43,211 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:42:43,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-12 13:42:43,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:43,249 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-11-12 13:42:43,464 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:42:43,464 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-11-12 13:42:43,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:42:43,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:43,647 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-12 13:42:43,647 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 56 treesize of output 38 [2024-11-12 13:42:43,651 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 27 treesize of output 22 [2024-11-12 13:42:43,861 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-12 13:42:43,861 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2024-11-12 13:42:43,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-12 13:42:43,872 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-11-12 13:42:44,022 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_11|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2024-11-12 13:42:44,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:44,049 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-12 13:42:44,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2024-11-12 13:42:44,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:44,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:44,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 33 [2024-11-12 13:42:44,071 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-12 13:42:44,072 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 28 treesize of output 30 [2024-11-12 13:42:44,599 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:44,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:44,605 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-11-12 13:42:44,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 35 [2024-11-12 13:42:44,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-12 13:42:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:42:44,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:45,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786146769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:45,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:42:45,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2024-11-12 13:42:45,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686602819] [2024-11-12 13:42:45,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:45,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-12 13:42:45,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:45,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-12 13:42:45,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3253, Unknown=1, NotChecked=114, Total=3540 [2024-11-12 13:42:45,506 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 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-11-12 13:42:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:51,830 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-12 13:42:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 13:42:51,831 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 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 51 [2024-11-12 13:42:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:51,831 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:42:51,831 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:42:51,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=355, Invalid=5967, Unknown=2, NotChecked=156, Total=6480 [2024-11-12 13:42:51,833 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 77 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 2220 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1985 Invalid, 0 Unknown, 102 Unchecked, 1.2s Time] [2024-11-12 13:42:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:42:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-12 13:42:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 91 states have internal predecessors, (97), 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-11-12 13:42:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-12 13:42:51,835 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 51 [2024-11-12 13:42:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:51,836 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-12 13:42:51,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 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-11-12 13:42:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-12 13:42:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:42:51,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:51,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:51,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-12 13:42:52,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:52,037 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 618104020, now seen corresponding path program 1 times [2024-11-12 13:42:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134316167] [2024-11-12 13:42:52,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 13:42:52,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134316167] [2024-11-12 13:42:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134316167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:42:52,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:42:52,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:42:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513094745] [2024-11-12 13:42:52,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:42:52,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:42:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:52,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:42:52,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:42:52,366 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:42:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:52,535 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-12 13:42:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:42:52,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2024-11-12 13:42:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:52,537 INFO L225 Difference]: With dead ends: 99 [2024-11-12 13:42:52,537 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 13:42:52,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:42:52,537 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:52,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 474 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:42:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 13:42:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-12 13:42:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 89 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-11-12 13:42:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-11-12 13:42:52,540 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 53 [2024-11-12 13:42:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-11-12 13:42:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:42:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-11-12 13:42:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 13:42:52,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:52,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:52,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:42:52,541 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:52,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash 825435750, now seen corresponding path program 1 times [2024-11-12 13:42:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083380839] [2024-11-12 13:42:52,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:42:53,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083380839] [2024-11-12 13:42:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083380839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367073038] [2024-11-12 13:42:53,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:53,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:53,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:53,396 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:53,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-12 13:42:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:53,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-12 13:42:53,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:53,605 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-11-12 13:42:53,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:42:53,716 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-11-12 13:42:53,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:53,863 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:42:53,863 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 25 treesize of output 26 [2024-11-12 13:42:53,986 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 20 treesize of output 8 [2024-11-12 13:42:53,988 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-11-12 13:42:54,024 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2024-11-12 13:42:54,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:42:54,034 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 29 treesize of output 24 [2024-11-12 13:42:54,040 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:42:54,040 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 15 treesize of output 15 [2024-11-12 13:42:54,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:54,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-12 13:42:54,241 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2024-11-12 13:42:54,241 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 28 treesize of output 15 [2024-11-12 13:42:54,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:54,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:54,285 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 16 treesize of output 11 [2024-11-12 13:42:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:42:54,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:42:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367073038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:54,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:42:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 45 [2024-11-12 13:42:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739512109] [2024-11-12 13:42:54,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:42:54,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-12 13:42:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:42:54,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-12 13:42:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2302, Unknown=1, NotChecked=96, Total=2550 [2024-11-12 13:42:54,525 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 45 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 38 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:42:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:42:55,616 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-12 13:42:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:42:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 38 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2024-11-12 13:42:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:42:55,617 INFO L225 Difference]: With dead ends: 95 [2024-11-12 13:42:55,617 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 13:42:55,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=318, Invalid=3717, Unknown=1, NotChecked=124, Total=4160 [2024-11-12 13:42:55,618 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:42:55,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1630 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1251 Invalid, 0 Unknown, 91 Unchecked, 0.5s Time] [2024-11-12 13:42:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 13:42:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 13:42:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 89 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-11-12 13:42:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-12 13:42:55,620 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 57 [2024-11-12 13:42:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:42:55,620 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-12 13:42:55,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 38 states have internal predecessors, (81), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:42:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-12 13:42:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 13:42:55,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:42:55,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:42:55,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-12 13:42:55,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:55,821 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:42:55,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:42:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash 600644937, now seen corresponding path program 1 times [2024-11-12 13:42:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:42:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812610176] [2024-11-12 13:42:55,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:42:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:42:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:42:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:42:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:42:57,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:42:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812610176] [2024-11-12 13:42:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812610176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:42:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139716942] [2024-11-12 13:42:57,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:42:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:42:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:42:57,086 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:42:57,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-12 13:42:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:42:57,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-12 13:42:57,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:42:57,304 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-11-12 13:42:57,531 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:42:57,532 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:42:57,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:42:57,724 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 16 treesize of output 11 [2024-11-12 13:42:57,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11-12 13:42:57,871 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 11 treesize of output 3 [2024-11-12 13:42:58,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:58,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:42:58,084 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 23 treesize of output 11 [2024-11-12 13:42:58,258 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-12 13:42:58,259 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-12 13:42:58,282 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:42:58,282 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-12 13:42:59,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:59,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:59,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2024-11-12 13:42:59,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:42:59,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-12 13:42:59,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:42:59,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:59,727 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-12 13:42:59,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2024-11-12 13:42:59,732 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:42:59,740 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-12 13:42:59,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-12 13:42:59,871 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 20 treesize of output 15 [2024-11-12 13:42:59,933 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 19 treesize of output 11 [2024-11-12 13:42:59,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:42:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:42:59,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:43:00,060 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3110 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3110) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-12 13:43:00,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3110 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3110) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-11-12 13:43:01,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:01,132 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2024-11-12 13:43:01,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:43:01,145 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 94 treesize of output 95 [2024-11-12 13:43:01,150 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 35 treesize of output 19 [2024-11-12 13:43:01,157 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 195 treesize of output 176 [2024-11-12 13:43:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139716942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:01,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:43:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 37] total 64 [2024-11-12 13:43:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964824312] [2024-11-12 13:43:01,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:43:01,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-12 13:43:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:43:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-12 13:43:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=5750, Unknown=18, NotChecked=306, Total=6320 [2024-11-12 13:43:01,415 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 64 states, 61 states have (on average 1.721311475409836) internal successors, (105), 55 states have internal predecessors, (105), 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-11-12 13:43:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:43:06,209 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2024-11-12 13:43:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 13:43:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 1.721311475409836) internal successors, (105), 55 states have internal predecessors, (105), 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 62 [2024-11-12 13:43:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:43:06,210 INFO L225 Difference]: With dead ends: 95 [2024-11-12 13:43:06,210 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 13:43:06,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=548, Invalid=11213, Unknown=19, NotChecked=430, Total=12210 [2024-11-12 13:43:06,211 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:43:06,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2214 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 13:43:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 13:43:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 13:43:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.24) internal successors, (93), 89 states have internal predecessors, (93), 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-11-12 13:43:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-12 13:43:06,213 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 62 [2024-11-12 13:43:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:43:06,213 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-12 13:43:06,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 1.721311475409836) internal successors, (105), 55 states have internal predecessors, (105), 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-11-12 13:43:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-12 13:43:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 13:43:06,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:43:06,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:43:06,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-12 13:43:06,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-12 13:43:06,415 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-12 13:43:06,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:43:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash 600625019, now seen corresponding path program 1 times [2024-11-12 13:43:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:43:06,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173031502] [2024-11-12 13:43:06,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:43:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:07,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:43:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 13:43:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 13:43:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:43:08,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:43:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173031502] [2024-11-12 13:43:08,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173031502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:43:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267603516] [2024-11-12 13:43:08,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:43:08,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:43:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:43:08,041 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:43:08,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-12 13:43:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:43:08,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-12 13:43:08,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:43:08,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:43:08,608 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 23 treesize of output 11 [2024-11-12 13:43:09,340 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 11 treesize of output 3 [2024-11-12 13:43:09,925 INFO L349 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2024-11-12 13:43:09,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2024-11-12 13:43:10,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 28 [2024-11-12 13:43:10,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:43:10,106 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-12 13:43:10,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-12 13:43:10,320 INFO L349 Elim1Store]: treesize reduction 100, result has 33.8 percent of original size [2024-11-12 13:43:10,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 93 [2024-11-12 13:43:10,852 INFO L349 Elim1Store]: treesize reduction 16, result has 90.5 percent of original size [2024-11-12 13:43:10,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 168 treesize of output 268 [2024-11-12 13:43:10,867 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-12 13:43:10,867 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 15 treesize of output 7 [2024-11-12 13:43:11,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:43:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:43:11,956 INFO L312 TraceCheckSpWp]: Computing backward predicates...